✦ LIBER ✦

On the linear vertex-arboricity of a planar graph

✍ Scribed by K. S. Poh

Publisher: John Wiley and Sons
Year: 1990
Tongue: English
Weight: 153 KB
Volume: 14
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190140108

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 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

## 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

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 ∆ =

An inequality involving the vertex arbor

An inequality involving the vertex arboricity and edge arboricity of a graph

✍ Stefan A. Burr 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

Note on vertex degrees of planar graphs

✍ Miroslaw Truszczyáski 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

The linear arboricity of planar graphs o

The linear arboricity of planar graphs of maximum degree seven is four

✍ Jian-Liang Wu; Yu-Wen Wu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

## Abstract The linear arboricity of a graph __G__ is the minimum number of linear forests which partition the edges of __G__. Akiyama et al. conjectured that $\lceil {\Delta {({G})}\over {2}}\rceil \leq {la}({G}) \leq \lceil {\Delta({G})+{1}\over {2}}\rceil$ for any simple graph __G__. Wu wu prove

On the vertex face total chromatic numbe

On the vertex face total chromatic number of planar graphs

✍ Weifan, Wang; Jiazhuang, Liu 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 471 KB 👁 2 views

Let G be a planar graph. The vertex face total chromatic number ,y13(G) of G is the least number of colors assigned to V(G) U F(G) such that no adjacent or incident elements receive the same color. The main results of this paper are as follows: (1) We give the vertex face total chromatic number for