An analogue of Reed's conjecture for digraphs
Fuente:
arXiv
Saved in:
| Main Authors: | Kawarabayashi, Ken-ichi, Picasarri-Arrieta, Lucas |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
$(Δ-1)$-dicolouring of digraphs
by: Harutyunyan, Ararat, et al.
Published: (2025)
by: Harutyunyan, Ararat, et al.
Published: (2025)
Generalized DP-colorings of digraphs
by: Picasarri-Arrieta, Lucas, et al.
Published: (2025)
by: Picasarri-Arrieta, Lucas, et al.
Published: (2025)
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)
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)
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)
A quasi-polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2025)
by: Houdaigoui, Sarah, et al.
Published: (2025)
A polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2026)
by: Houdaigoui, Sarah, 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)
Backbone colouring of chordal graphs
by: Araújo, Júlio, et al.
Published: (2025)
by: Araújo, Júlio, et al.
Published: (2025)
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)
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)
EPTAS for Hard Graph Cut Problems for Dense Graphs
by: Deguchi, Kaisei, et al.
Published: (2026)
by: Deguchi, Kaisei, et al.
Published: (2026)
Invertibility of digraphs and tournaments
by: Alon, Noga, et al.
Published: (2022)
by: Alon, Noga, et al.
Published: (2022)
Algorithms and hardness for Metric Dimension on digraphs
by: Dailly, Antoine, et al.
Published: (2023)
by: Dailly, Antoine, et al.
Published: (2023)
Karp's patching algorithm on dense digraph
by: Frieze, Alan
Published: (2025)
by: Frieze, Alan
Published: (2025)
The complexity of computing the period and the exponent of a digraph
by: Kiefer, Stefan, et al.
Published: (2024)
by: Kiefer, Stefan, et al.
Published: (2024)
Orthogonality between acyclic subdigraphs and paths in digraphs
by: Silva, Caroline A. de Paula, et al.
Published: (2026)
by: Silva, Caroline A. de Paula, et al.
Published: (2026)
Dividing sums of cycles in the semiring of functional digraphs
by: Bridoux, Florian, et al.
Published: (2025)
by: Bridoux, Florian, et al.
Published: (2025)
There is no prime functional digraph: Seifert's proof revisited
by: Richard, Adrien
Published: (2025)
by: Richard, Adrien
Published: (2025)
Bounding the chromatic number of dense digraphs by arc neighborhoods
by: Klingelhoefer, Felix, et al.
Published: (2023)
by: Klingelhoefer, Felix, et al.
Published: (2023)
Unavoidable butterfly minors in digraphs of large cycle rank
by: Hatzel, Meike, et al.
Published: (2025)
by: Hatzel, Meike, et al.
Published: (2025)
Extremal digraphs for open neighbourhood location-domination and identifying codes
by: Foucaud, Florent, et al.
Published: (2023)
by: Foucaud, Florent, et al.
Published: (2023)
(Claw, C_3)-free digraphs with unbounded dichromatic number
by: Aubian, Guillaume, et al.
Published: (2026)
by: Aubian, Guillaume, et al.
Published: (2026)
A multipartite analogue of Dilworth's Theorem
by: Fox, Jacob, et al.
Published: (2024)
by: Fox, Jacob, et al.
Published: (2024)
Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
by: Cavallaro, Dario, et al.
Published: (2026)
by: Cavallaro, Dario, et al.
Published: (2026)
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)
Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs
by: Yu, Shanshan, et al.
Published: (2026)
by: Yu, Shanshan, et al.
Published: (2026)
Type-B analogue of Bell numbers using Rota's Umbral calculus approach
by: Bagno, Eli, et al.
Published: (2024)
by: Bagno, Eli, et al.
Published: (2024)
Toward Vu's conjecture
by: Bradshaw, Peter, et al.
Published: (2025)
by: Bradshaw, Peter, et al.
Published: (2025)
Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr's conjecture
by: Bessy, Stéphane, et al.
Published: (2024)
by: Bessy, Stéphane, et al.
Published: (2024)
On a recolouring version of Hadwiger's conjecture
by: Bonamy, Marthe, et al.
Published: (2021)
by: Bonamy, Marthe, et al.
Published: (2021)
The 1/3-conjectures for domination in cubic graphs
by: Dorbec, Paul, et al.
Published: (2024)
by: Dorbec, Paul, et al.
Published: (2024)
Balanced-chromatic number and Hadwiger-like conjectures
by: Jiménez, Andrea, et al.
Published: (2023)
by: Jiménez, Andrea, et al.
Published: (2023)
Disproving two conjectures on the Hamiltonicity of Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)
by: Brenner, Sofia, et al.
Published: (2025)
Extension of the Gyárfás-Sumner conjecture to signed graphs
by: Aubian, Guillaume, et al.
Published: (2025)
by: Aubian, Guillaume, et al.
Published: (2025)
Similar Items
-
$(Δ-1)$-dicolouring of digraphs
by: Harutyunyan, Ararat, et al.
Published: (2025) -
Generalized DP-colorings of digraphs
by: Picasarri-Arrieta, Lucas, et al.
Published: (2025) -
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) -
Minimum number of arcs in $k$-critical digraphs with order at most $2k-1$
by: Picasarri-Arrieta, Lucas, et al.
Published: (2023)