Even circuits in planar graphs

P. D. Seymour

doi:10.1016/0095-8956(81)90034-4

Even circuits in planar graphs

P. D. Seymour

Research output: Contribution to journal › Article › peer-review

26 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	327-338
Number of pages	12
Journal	Journal of Combinatorial Theory, Series B
Volume	31
Issue number	3
DOIs	https://doi.org/10.1016/0095-8956(81)90034-4
State	Published - Dec 1981
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/0095-8956(81)90034-4

Cite this

@article{bc3d708a164b4b62841c70ee984c2e1d,

title = "Even circuits in planar graphs",

abstract = "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.",

author = "Seymour, {P. D.}",

year = "1981",

month = dec,

doi = "10.1016/0095-8956(81)90034-4",

language = "English (US)",

volume = "31",

pages = "327--338",

journal = "Journal of Combinatorial Theory, Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Even circuits in planar graphs

AU - Seymour, P. D.

PY - 1981/12

Y1 - 1981/12

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

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

UR - http://www.scopus.com/inward/record.url?scp=0039797420&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0039797420&partnerID=8YFLogxK

U2 - 10.1016/0095-8956(81)90034-4

DO - 10.1016/0095-8956(81)90034-4

M3 - Article

AN - SCOPUS:0039797420

SN - 0095-8956

VL - 31

SP - 327

EP - 338

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

IS - 3

ER -

Even circuits in planar graphs

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this