Internally 4-connected projective-planar graphs

DOI10.1016/J.JCTB.2014.03.003MaRDI QIDQ740651zbMATH OpenOpenAlexFDO

Authors Guoli Ding, Perry Iverson

Publication date 4 September 2014

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.2014.03.003

zbMATH Keywords

projective graphinternally 4-connectedcomputer proofforbidden minor

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph minors (05C83)

Recommendations

• Hall-type results for 3-connected projective graphs
• Minor-minimal non-projective planar graphs with an internal 3-separation
• Re-embedding structures of 4-connected projective-planar graphs
• \(K_{6}\) and icosahedron minors in 5-connected projective planar graphs
• Internally 4-connected graphs with no \(\{\text{cube}, V_8\}\)-minor

Cites work

• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• A kuratowski theorem for the projective plane

Cited in

(5)

• Projective-planar graphs with no \(K_{3,4}\)-minor. II.
• Internally 4-connected graphs with no \(\{\text{cube}, V_8\}\)-minor
• 4-chromatic projective graphs
• Obstruction sets for outer-projective-planar graphs
• Hall-type results for 3-connected projective graphs

This page was built for publication: Internally 4-connected projective-planar graphs

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