Nonadditivity of the 1-genus of a graph

DOI10.1016/S0012-365X(97)00070-8MaRDI QIDQ1584230zbMATH OpenOpenAlexFDO

Authors Vladimir P. Korzhik

Publication date 2 November 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(97)00070-8

zbMATH Keywords

genusorientable surface

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• An additivity theorem for the genus of a graph
• scientific article; zbMATH DE number 4019088
• On the non-orientable genus of a 2-connected graph
• The nonorientable genus is additive
• The orientable genus is nonadditive

Cites work

• A lower bound for the one-chromatic number of a surface
• A possibly infinite series of surfaces with known 1-chromatic number
• Additivity of the genus of a graph
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3735846 (Why is no real title available?)

Cited in

(4)

• Minimal non-1-planar graphs
• scientific article; zbMATH DE number 4019088 (Why is no real title available?)
• The nonorientable genus is additive
• The maximum and minimum genus of a multibranched surface

This page was built for publication: Nonadditivity of the 1-genus of a graph

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