On the 1-chromatic number of nonorientable surfaces with large genus

DOI10.1016/j.jctb.2011.10.001zbMath1244.05091OpenAlexW2072494605MaRDI QIDQ412163

Vladimir P. Korzhik

Publication date: 4 May 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2011.10.001

zbMATH Keywords

complete graphnonorientable surfaceone-chromatic numbertopological embedding

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Coloring vertices and faces of locally planar graphs, 1-embeddability of complete multipartite graphs on the projective plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene
• A lower bound for the one-chromatic number of a surface
• 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