๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph

โœ Scribed by Wang, Yingqian; Xu, Jinghan


Book ID
127081121
Publisher
Elsevier Science
Year
2015
Tongue
English
Weight
550 KB
Volume
43
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Decomposing a Planar Graph into an Indep
โœ Carsten Thomassen ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 126 KB

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.