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

DOI10.1016/J.JCTB.2011.10.001MaRDI QIDQ412163zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A possibly infinite series of surfaces with known 1-chromatic number
• A tighter bounding interval for the 1-chromatic number of a surface
• A lower bound for the one-chromatic number of a surface
• An infinite series of surfaces with known 1-chromatic number
• scientific article; zbMATH DE number 4089570

Cites work

• A lower bound for the one-chromatic number of a surface
• A possibly infinite series of surfaces with known 1-chromatic number
• A tighter bounding interval for the 1-chromatic number of a surface
• An infinite series of surfaces with known 1-chromatic number
• Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene
• scientific article; zbMATH DE number 3900784 (Why is no real title available?)
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 4047749 (Why is no real title available?)
• scientific article; zbMATH DE number 3179262 (Why is no real title available?)
• scientific article; zbMATH DE number 3735846 (Why is no real title available?)
• scientific article; zbMATH DE number 3756556 (Why is no real title available?)
• scientific article; zbMATH DE number 3450230 (Why is no real title available?)

Cited in

(10)

• 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
• Another proof of the map color theorem for nonorientable surfaces.
• 1-embeddability of complete multipartite graphs on the projective plane
• scientific article; zbMATH DE number 913549 (Why is no real title available?)
• Finite fields and the 1‐chromatic number of orientable surfaces
• The vertex-face chromatic number of almost all nonorientable surfaces
• Coloring vertices and faces of locally planar graphs

This page was built for publication: On the 1-chromatic number of nonorientable surfaces with large genus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412163)