✦ LIBER ✦

A note on the arboricity of graphs

✍ Scribed by Martin Kochol

Book ID: 105541128
Publisher: Springer Japan
Year: 1992
Tongue: English
Weight: 151 KB
Volume: 8
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf02351587

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on List Arboricity

✍ P.D. Seymour 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 181 KB

We show that, for any graph or matroid, its ``arboricity'' and its ``list arboricity'' are equal. ## 1998 Academic Press A celebrated recent theorem of Galvin [2] asserts that for any bipartite graph, its chromatic index and its list-chromatic index are equal. This can be formulated as a property

On the critical point-arboricity graphs

✍ Riste Škrekovski 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract In this paper, we study the critical point‐arboricity graphs. We prove two lower bounds for the number of edges of __k__‐critical point‐arboricity graphs. A theorem of Kronk is extended by proving that the point‐arboricity of a graph __G__ embedded on a surface __S__ with Euler genus __

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

The linear arboricity of graphs

✍ N. Alon 📂 Article 📅 1988 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 636 KB

The star arboricity of graphs

✍ I. Algor; N. Alon 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 714 KB

On the linear k-arboricity of cubic grap

On the linear k-arboricity of cubic graphs

✍ Bill Jackson; Nicholas C. Wormald 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 231 KB

Bermond et al. [2] conjectured that the edge set of a cubic graph G can be partitioned into two k-linear forests, that is to say two forests whose connected components are paths of length at most k, for all k >/5. We shall prove a weaker result that the statement is valid for all k/> 18. All graphs