Triangulations and the Hajós conjecture
From MaRDI portal
Publication:5901432
DOI10.1002/jgt.20341zbMath1189.05161OpenAlexW4231743847WikidataQ123227988 ScholiaQ123227988MaRDI QIDQ5901432
Publication date: 20 February 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20341
Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)
Related Items (2)
Cites Work
- Unnamed Item
- Hajos' graph-coloring conjecture: Variations and counterexamples
- Five-coloring graphs on the torus
- Nearly perfect matchings in regular simple hypergraphs
- The genus of a random graph
- Improved Bounds for Topological Cliques in Graphs of Large Girth
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- The chromatic number of random graphs
This page was built for publication: Triangulations and the Hajós conjecture