✦ LIBER ✦

The Point-Arboricity of Planar Graphs

✍ Scribed by Chartrand, G.; Kronk, H. V.

Book ID: 120097085
Publisher: Oxford University Press
Year: 1969
Tongue: English
Weight: 127 KB
Volume: s1-44
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s1-44.1.612

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On point-linear arboricity of planar gra

On point-linear arboricity of planar graphs

✍ Jianfang Wang 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 220 KB

The point-linear arboricity of a graph G = (V, E), written as p,(G), is defined as p,(G) =min{k / there exists a partition of V into k subsets, V =LJt, V,, such that (V,) is a linear forest for 1 <i <k}. In this paper, we will discuss the point-linear arboricity of planar graphs and obtained follow

The Linear 2-Arboricity of Planar Graphs

✍ Ko-Wei Lih; Li-Da Tong; Wei-Fan Wang 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 114 KB

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

Point Arboricity Critical Graphs Exist

✍ Bollobas, B.; Harary, F. 📂 Article 📅 1975 🏛 Oxford University Press 🌐 English ⚖ 142 KB

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 __

List Point Arboricity of Dense Graphs

✍ Lingyan Zhen; Baoyindureng Wu 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 118 KB