Remarks on a conjecture of Barát and Tóth
zbMATH Open1300.05105MaRDI QIDQ405159FDOQ405159
Authors: Atílio G. Luiz, R. B. Richter
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Map-Colour Theorems
- Title not available (Why is that?)
- On the conjecture of Hajos
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Crossings, colorings, and cliques
- Hajos' graph-coloring conjecture: Variations and counterexamples
- \(3n-5\) edges do force a subdivision of \(K_5\)
- 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
- Title not available (Why is that?)
- Towards the Albertson conjecture
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)