𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Danjun Huang; Wai Chee Shiu; Weifan Wang

Book ID
113567658
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
965 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Planar graphs without 4-cycles adjacent
Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
✍ Oleg V. Borodin; Anna O. Ivanova πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 80 KB

## Abstract It is known that not all planar graphs are 4‐choosable; neither all of them are vertex 2‐arborable. However, planar graphs without 4‐cycles and even those without 4‐cycles adjacent to 3‐cycles are known to be 4‐choosable. We extend this last result in terms of covering the vertices of a

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 linear arboricity of planar graph
On the linear arboricity of planar graphs
✍ Wu, Jian-Liang πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 188 KB πŸ‘ 2 views

The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. Akiyama, Exoo, and Harary conjectured for any simple graph G with maximum degree βˆ†. The conjecture has been proved to be true for graphs having βˆ† =