✦ LIBER ✦

On the vertex-arboricity of -minor-free graphs of diameter 2

✍ Scribed by Huang, Fei; Wang, Xiumei; Yuan, Jinjiang

Book ID: 122211512
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 360 KB
Volume: 322
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.12.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On linear vertex-arboricity of complemen

On linear vertex-arboricity of complementary graphs

✍ Yousef Alavi; Jiuqiang Liu; Jianfang Wang 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 323 KB 👁 1 views

## Abstract The linear vertex‐arboricity ρ(__G__) of a graph __G__ is defined to be the minimum number of subsets into which the vertex set of __G__ can be partitioned such that each subset induces a linear forest. In this paper, we give the sharp upper and lower bounds for the sum and product of l

Vertex Partitions of K4,4-Minor Free Gra

Vertex Partitions of K4,4-Minor Free Graphs

✍ Leif K. Jørgensen 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 121 KB

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

Strong-Diameter Decompositions of Minor

Strong-Diameter Decompositions of Minor Free Graphs

✍ Ittai Abraham; Cyril Gavoille; Dahlia Malkhi; Udi Wieder 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 638 KB

Adjacent vertex-distinguishing edge colo

Adjacent vertex-distinguishing edge colorings of -minor free graphs

✍ Weifan Wang; Yiqiao Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 213 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.