Saved in:
| Main Authors: | Havet, Frédéric, Hörsch, Florian, Picasarri-Arrieta, Lucas |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.12014 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On the minimum number of arcs in $4$-dicritical oriented graphs
by: Havet, Frédéric, et al.
Published: (2023)
by: Havet, Frédéric, et al.
Published: (2023)
Subdivisions in dicritical digraphs with large order or digirth
by: Picasarri-Arrieta, Lucas, et al.
Published: (2024)
by: Picasarri-Arrieta, Lucas, et al.
Published: (2024)
Complexity results on the decomposition of a digraph into directed linear forests and out-stars
by: Hörsch, Florian, et al.
Published: (2024)
by: Hörsch, Florian, et al.
Published: (2024)
On the minimum number of arcs in 4‐dicritical oriented graphs
by: Frédéric Havet, et al.
Published: (2024)
by: Frédéric Havet, et al.
Published: (2024)
Increasing arc-connectivity by bounded- and fixed-size inversions
by: Hörsch, Florian, et al.
Published: (2026)
by: Hörsch, Florian, et al.
Published: (2026)
Dichromatic number of chordal graphs
by: Bessy, Stéphane, et al.
Published: (2023)
by: Bessy, Stéphane, et al.
Published: (2023)
On the minimum number of inversions to make a digraph $k$-(arc-)strong
by: Duron, Julien, et al.
Published: (2023)
by: Duron, Julien, et al.
Published: (2023)
Generalized DP-colorings of digraphs
by: Picasarri-Arrieta, Lucas, et al.
Published: (2025)
by: Picasarri-Arrieta, Lucas, et al.
Published: (2025)
An analogue of Reed's conjecture for digraphs
by: Kawarabayashi, Ken-ichi, et al.
Published: (2024)
by: Kawarabayashi, Ken-ichi, et al.
Published: (2024)
Diameter of the inversion graph
by: Havet, Frédéric, et al.
Published: (2024)
by: Havet, Frédéric, et al.
Published: (2024)
Minimum number of arcs in $k$-critical digraphs with order at most $2k-1$
by: Picasarri-Arrieta, Lucas, et al.
Published: (2023)
by: Picasarri-Arrieta, Lucas, et al.
Published: (2023)
Redicolouring digraphs: directed treewidth and cycle-degeneracy
by: Nisse, Nicolas, et al.
Published: (2023)
by: Nisse, Nicolas, et al.
Published: (2023)
Blow-ups and extensions of trees in tournaments
by: Aboulker, Pierre, et al.
Published: (2024)
by: Aboulker, Pierre, et al.
Published: (2024)
Brooks-type colourings of digraphs in linear time
by: Gonçalves, Daniel, et al.
Published: (2024)
by: Gonçalves, Daniel, et al.
Published: (2024)
$(Δ-1)$-dicolouring of digraphs
by: Harutyunyan, Ararat, et al.
Published: (2025)
by: Harutyunyan, Ararat, et al.
Published: (2025)
Making an oriented graph acyclic using inversions of bounded or prescribed size
by: Bang-Jensen, Jørgen, et al.
Published: (2025)
by: Bang-Jensen, Jørgen, et al.
Published: (2025)
On the number of maximal independent sets and maximal induced bipartite subgraphs in $K_4$-free graphs
by: Hartel, Thilo, et al.
Published: (2025)
by: Hartel, Thilo, et al.
Published: (2025)
Backbone colouring of chordal graphs
by: Araújo, Júlio, et al.
Published: (2025)
by: Araújo, Júlio, et al.
Published: (2025)
Edge-colouring and orientations: applications to degree- and $χ$-boundedness
by: Char, Arnab, et al.
Published: (2025)
by: Char, Arnab, et al.
Published: (2025)
Constrained Flows in Networks
by: Bessy, Stéphane, et al.
Published: (2023)
by: Bessy, Stéphane, et al.
Published: (2023)
Acyclic dichromatic number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2025)
by: Bang-Jensen, Jørgen, et al.
Published: (2025)
Chromatic discrepancy of locally $s$-colourable graphs
by: Corsini, Timothée, et al.
Published: (2025)
by: Corsini, Timothée, et al.
Published: (2025)
On cuts of small chromatic number in sparse graphs
by: Aubian, Guillaume, et al.
Published: (2025)
by: Aubian, Guillaume, et al.
Published: (2025)
On the $(\leq p)$-inversion diameter of oriented graphs
by: Havet, Frédéric, et al.
Published: (2026)
by: Havet, Frédéric, et al.
Published: (2026)
On the list version of a conjecture of Erdős and Neumann-Lara
by: Harutyunyan, Ararat, et al.
Published: (2026)
by: Harutyunyan, Ararat, et al.
Published: (2026)
On the inversion number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2021)
by: Bang-Jensen, Jørgen, et al.
Published: (2021)
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
by: Aboulker, Pierre, et al.
Published: (2024)
by: Aboulker, Pierre, et al.
Published: (2024)
A complete characterization of split digraphs with a strong arc decomposition
by: Ai, Jiangdong, et al.
Published: (2024)
by: Ai, Jiangdong, et al.
Published: (2024)
Normal trees of digraphs
by: Reich, Florian
Published: (2024)
by: Reich, Florian
Published: (2024)
Revisiting classical results on kernels in digraphs
by: Langlois, Hélène, et al.
Published: (2025)
by: Langlois, Hélène, et al.
Published: (2025)
Minimum Spanning Trees with Bounded Degrees of Vertices in a Specified Stable Set
by: Brause, Christoph, et al.
Published: (2022)
by: Brause, Christoph, et al.
Published: (2022)
Halin's grid theorem for digraphs
by: Reich, Florian
Published: (2024)
by: Reich, Florian
Published: (2024)
Menger's theorem for ends of digraphs
by: Reich, Florian
Published: (2026)
by: Reich, Florian
Published: (2026)
On Hamiltonian bypasses in digraphs and bipartite digraphs
by: Darbinyan, Samvel Kh.
Published: (2025)
by: Darbinyan, Samvel Kh.
Published: (2025)
A star-comb lemma for finite digraphs
by: Reich, Florian
Published: (2024)
by: Reich, Florian
Published: (2024)
Dividing sums of cycles in the semiring of functional digraphs
by: Bridoux, Florian, et al.
Published: (2025)
by: Bridoux, Florian, et al.
Published: (2025)
Matroid-reachability-based decomposition into arborescences
by: Hörsch, Florian, et al.
Published: (2024)
by: Hörsch, Florian, et al.
Published: (2024)
A star-comb lemma for infinite digraphs
by: Reich, Florian
Published: (2024)
by: Reich, Florian
Published: (2024)
Distant digraph domination
by: Nguyen, Tung, et al.
Published: (2024)
by: Nguyen, Tung, et al.
Published: (2024)
Distance ideals of digraphs
by: Alfaro, Carlos A., et al.
Published: (2024)
by: Alfaro, Carlos A., et al.
Published: (2024)
Similar Items
-
On the minimum number of arcs in $4$-dicritical oriented graphs
by: Havet, Frédéric, et al.
Published: (2023) -
Subdivisions in dicritical digraphs with large order or digirth
by: Picasarri-Arrieta, Lucas, et al.
Published: (2024) -
Complexity results on the decomposition of a digraph into directed linear forests and out-stars
by: Hörsch, Florian, et al.
Published: (2024) -
On the minimum number of arcs in 4‐dicritical oriented graphs
by: Frédéric Havet, et al.
Published: (2024) -
Increasing arc-connectivity by bounded- and fixed-size inversions
by: Hörsch, Florian, et al.
Published: (2026)