✦ LIBER ✦

Point Arboricity Critical Graphs Exist

✍ Scribed by Bollobas, B.; Harary, F.

Book ID: 120096145
Publisher: Oxford University Press
Year: 1975
Tongue: English
Weight: 142 KB
Volume: s2-12
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-12.1.97

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The Point-Arboricity of Planar Graphs

✍ Chartrand, G.; Kronk, H. V. 📂 Article 📅 1969 🏛 Oxford University Press 🌐 English ⚖ 127 KB

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

On Graphs with Prescribed Clique Number

On Graphs with Prescribed Clique Number and Point-Arboricity

✍ Mitchem, J. 📂 Article 📅 1971 🏛 Oxford University Press 🌐 English ⚖ 117 KB

The point-arboricity of a graph

✍ Gary Chartrand; Hudson V. Kronk; Curtiss E. Wall 📂 Article 📅 1968 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 337 KB