A lower bound for the one-chromatic number of a surface
From MaRDI portal
Publication:1328382
DOI10.1006/jctb.1994.1028zbMath0797.05046OpenAlexW2002779087MaRDI QIDQ1328382
Publication date: 10 October 1994
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1994.1028
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
A tighter bounding interval for the 1-chromatic number of a surface ⋮ An infinite series of surfaces with known 1-chromatic number ⋮ A possibly infinite series of surfaces with known 1-chromatic number ⋮ On the 1-chromatic number of nonorientable surfaces with large genus ⋮ Coloring vertices and faces of maps on surfaces ⋮ Nonadditivity of the 1-genus of a graph
This page was built for publication: A lower bound for the one-chromatic number of a surface
