Skip to main content
Journal ArticleOPEN ACCESS

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

Journal of Combinatorial Theory. Series B (2001) 83(2) 262-271
DOI: 10.1006/jctb.2001.2056
19Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2001 Academic Press.

Cite

CITATION STYLE

APA

Thomassen, C. (2001). Decomposing a planar graph into an independent set and a 3-degenerate graph. Journal of Combinatorial Theory. Series B, 83(2), 262–271. https://doi.org/10.1006/jctb.2001.2056

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free