Even circuits in planar graphs

Research output: Contribution to journalArticlepeer-review

25 Scopus citations


We prove that a planar graph can be partitioned into edge-disjoint circuits of even length, if and only if every vertex has even valency and every block has an even number of edges.

Original languageEnglish (US)
Pages (from-to)327-338
Number of pages12
JournalJournal of Combinatorial Theory, Series B
Issue number3
StatePublished - Dec 1981
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 'Even circuits in planar graphs'. Together they form a unique fingerprint.

Cite this