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 | |
Publication status | Published - Nov 2001 |