✦ LIBER ✦

Vertex-arboricity of planar graphs without intersecting triangles

✍ Scribed by Min Chen; André Raspaud; Weifan Wang

Book ID: 113582404
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 535 KB
Volume: 33
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2011.09.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the vertex-arboricity of planar graph

On the vertex-arboricity of planar graphs without 7-cycles

✍ Danjun Huang; Wai Chee Shiu; Weifan Wang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 965 KB

On acyclic edge coloring of planar graph

On acyclic edge coloring of planar graphs without intersecting triangles

✍ Ping Sheng; Yingqian Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 219 KB

Choosability and Edge Choosability of Pl

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

✍ Wang, Wei-Fan; Lih, Ko-Wei 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 140 KB

Equitable vertex arboricity of graphs

✍ Wu, Jian-Liang; Zhang, Xin; Li, Hailuan 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 380 KB

On the linear vertex-arboricity of a pla

On the linear vertex-arboricity of a planar graph

✍ K. S. Poh 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 2 views

## Abstract We prove in this note that the linear vertex‐arboricity of any planar graph is at most three, which confirms a conjecture due to Broere and Mynhardt, and others.

On the 9-total-colorability of planar gr

On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles

✍ Lan Shen; Yingqian Wang; Weifan Wang; Ko-Wei Lih 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 638 KB