A Petersen on a pentagon

DOI10.1006/JCTB.1997.1791MaRDI QIDQ1386419zbMATH OpenOpenAlexFDO

Authors Klaus Truemper, Paul Seymour

Publication date 21 June 1999

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

Full work available at URL https://doi.org/10.1006/jctb.1997.1791

zbMATH Keywords

cyclic connectivityPetersen graphsubdivision

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Review text

The following theorem is proved: Let \(G\) be a cyclically 5-connected cubic graph, and let \(C\) be a cycle of \(G\) with length 5. If there is a subdivision of the Petersen graph in \(G\), then there is one containing \(C\). This result provides a significant simplification in checking whether a given graph does or does not contain a subdivision of the Petersen graph.

Recommendations

• scientific article; zbMATH DE number 4075942
• scientific article; zbMATH DE number 4208960
• On the diagonal and inscribed pentagons of a pentagon
• Pentangulated graphs
• Pentagon packing in a circle and on a sphere

Cited in

(4)

• Multiple Petersen subdivisions in permutation graphs
• Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor
• Excluded minors in cubic graphs
• Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights.

This page was built for publication: A Petersen on a pentagon

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