Remarks on a conjecture of Barát and Tóth
From MaRDI portal
Publication:405159
zbMath1300.05105MaRDI QIDQ405159
R. Bruce Richter, Atílio G. Luiz
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p57
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Towards the Albertson conjecture
- Crossings, colorings, and cliques
- Hajos' graph-coloring conjecture: Variations and counterexamples
- \(3n-5\) edges do force a subdivision of \(K_5\)
- On the conjecture of Hajos
- Map Colour Theorems Related To the Heawood Colour Formula
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- Small graphs with chromatic number 5: A computer search
- Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Map-Colour Theorems
This page was built for publication: Remarks on a conjecture of Barát and Tóth
