Jordan circuits of a graph

DOI10.1016/0097-3165(71)90025-2MaRDI QIDQ2546875zbMATH OpenOpenAlexFDO

Authors Gary Haggard, J. Richard Buchi

Publication date 1971

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

Full work available at URL https://doi.org/10.1016/0097-3165(71)90025-2

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 3887721
• A Kuratowski theorem for nonorientable surfaces
• A strengthening of the Kuratowski planarity criterion for 3-connected graphs
• A refinement of Kuratowski's theorem
• scientific article; zbMATH DE number 475620

Cites work

• scientific article; zbMATH DE number 3144962 (Why is no real title available?)
• scientific article; zbMATH DE number 3165199 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• Matroids and Graphs

Cited in

(2)

• On 2-cycles of graphs
• Characterization of curve map graphs

This page was built for publication: Jordan circuits of a graph

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