𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new approach to the linearity of testing planarity of graphs

✍ Scribed by Yanpei Liu

Book ID
112665988
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
1988
Tongue
English
Weight
581 KB
Volume
4
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Linear 2-Arboricity of Planar Graphs
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 βˆ† =

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.