Recommendations
Cites work
- scientific article; zbMATH DE number 3232667 (Why is no real title available?)
- scientific article; zbMATH DE number 3394160 (Why is no real title available?)
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Crossings, colorings, and cliques
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- Hajos' graph-coloring conjecture: Variations and counterexamples
- Map Colour Theorems Related To the Heawood Colour Formula
- Map-Colour Theorems
- On the conjecture of Hajos
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
- Small graphs with chromatic number 5: A computer search
- Towards the Albertson conjecture
- \(3n-5\) edges do force a subdivision of \(K_5\)
Cited in
(3)
This page was built for publication: Remarks on a conjecture of Barát and Tóth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405159)