✦ 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
DOI: 10.1016/j.ejc.2014.08.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Planar graphs decomposable into a forest

Planar graphs decomposable into a forest and a matching

✍ Oleg V. Borodin; Anna O. Ivanova; Alexandr V. Kostochka; Naeem N. Sheikh 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Decomposing a Planar Graph into an Indep

Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph

✍ 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.

Acyclic edge coloring of planar graphs w

Acyclic edge coloring of planar graphs without a(3)-cycle adjacent to a(6)-cycle

✍ Yiqiao Wang,Qiaojun Shu,Jian-Liang Wu… 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 541 KB

The acyclic edge coloring of planar grap

The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle

✍ Wang, Yiqiao; Shu, Qiaojun; Wang, Weifan 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 506 KB

Partitioning a Planar Graph of Girth 10

Partitioning a Planar Graph of Girth 10 into a Forest and a Matching

✍ A. Bassa; J. Burns; J. Campbell; A. Deshpande; J. Farley; M. Halsey; S.-Y. Ho; D 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

A note on the total coloring of planar g

A note on the total coloring of planar graphs without adjacent 4-cycles

✍ Hui-Juan Wang; Jian-Liang Wu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 233 KB