A Petersen on a pentagon

Paul Seymour, Klaus Truemper

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


Let G be a cyclically 5-connected cubic graph, and let C be a circuit of G of length 5. We prove that if there is a subgraph of G homeomorphic to the Petersen graph, then there is one which in addition contains C. This greatly simplifies checking whether G has a subgraph homeomorphic to the Petersen graph.

Original languageEnglish (US)
Pages (from-to)63-79
Number of pages17
JournalJournal of Combinatorial Theory. Series B
Issue number1
StatePublished - 1998
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'A Petersen on a pentagon'. Together they form a unique fingerprint.

Cite this