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

Carsten Thomassen

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

Research output: Book/Report › Report › 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 aset inducing a $3$-degenerate graph.

Original language	English

Number of pages	8
Publication status	Published - 2000

OpenUrl availability

Full text

Cite this

@book{32c4df935715402eb96091fce0e8c876,

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 aset inducing a $3$-degenerate graph.",

author = "Carsten Thomassen",

year = "2000",

language = "English",

}

TY - RPRT

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

AU - Thomassen, Carsten

PY - 2000

Y1 - 2000

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 aset inducing a $3$-degenerate graph.

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 aset inducing a $3$-degenerate graph.

M3 - Report

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

ER -