Decomposing a planar graph into an independent set and a  3-degenerate graph

Carsten Thomassen

doi:10.1006/jctb.2001.2056

Decomposing a planar graph into an independent set and a 3-degenerate graph

Carsten Thomassen

Research output: Contribution to journal › Journal article › Research › peer-review

Abstract

We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar graph can be decomposed into an independent set and a set inducing a 3-degenerate graph. (C) 2001 Academic Press.

Original language	English
Journal	Journal of Combinatorial Theory. Series B
Volume	83
Issue number	2
Pages (from-to)	262-271
ISSN	0095-8956
DOIs	https://doi.org/10.1006/jctb.2001.2056
Publication status	Published - Nov 2001

Access to Document

10.1006/jctb.2001.2056

OpenUrl availability

Check availability in DTU Findit

Cite this

@article{f80f6ad96caf4096bd6d4ce90b7e24e2,

title = "Decomposing a planar graph into an independent set and a 3-degenerate graph",

abstract = "We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar graph can be decomposed into an independent set and a set inducing a 3-degenerate graph. (C) 2001 Academic Press.",

author = "Carsten Thomassen",

year = "2001",

month = nov,

doi = "10.1006/jctb.2001.2056",

language = "English",

volume = "83",

pages = "262--271",

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

issn = "0095-8956",

publisher = "Academic Press",

number = "2",

}

TY - JOUR

T1 - Decomposing a planar graph into an independent set and a 3-degenerate graph

AU - Thomassen, Carsten

PY - 2001/11

Y1 - 2001/11

N2 - We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar graph can be decomposed into an independent set and a set inducing a 3-degenerate graph. (C) 2001 Academic Press.

AB - We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar graph can be decomposed into an independent set and a set inducing a 3-degenerate graph. (C) 2001 Academic Press.

U2 - 10.1006/jctb.2001.2056

DO - 10.1006/jctb.2001.2056

M3 - Journal article

SN - 0095-8956

VL - 83

SP - 262

EP - 271

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

IS - 2

ER -

Decomposing a planar graph into an independent set and a 3-degenerate graph

Abstract

Access to Document

OpenUrl availability

Fingerprint

Cite this