On the minimum number of arcs in 4-dicritical oriented graphs
From MaRDI portal
Publication:6657587
DOI10.1002/JGT.23159MaRDI QIDQ6657587
Frédéric Havet, Clément Rambaud, L. Picasarri-Arrieta
Publication date: 6 January 2025
Published in: Journal of Graph Theory (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Cites Work
- Ore's conjecture on color-critical graphs is almost true
- A Brooks-type result for sparse critical graphs
- The minimum number of edges in 4-critical digraphs of given order
- On the minimum number of edges in triangle-free 5-critical graphs
- Structure in sparse \(k\)-critical graphs
- Gallai's Theorem for List Coloring of Digraphs
- A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
- On the structure of 5- and 6-chromatic abstract graphs.
- On the number of edges in colour-critical graphs and hypergraphs
- Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph
- On the minimum number of arcs in $4$-dicritical oriented graphs
- On the minimum number of arcs in \(k\)-dicritical oriented graphs
This page was built for publication: On the minimum number of arcs in 4-dicritical oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657587)
