On the vertex-arboricity of planar graphs
Authors:
- André RaspaudARAndré Raspaud
- Weifan WangWWWeifan Wang
- 1 May 2008
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 29 (4) , 1064-1075
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Choosability and edge choosability of planar graphs without five cyclesApplied Mathematics Letters, 2002
- On the critical point‐arboricity graphsJournal of Graph Theory, 2001
- Parallel complexity of partitioning a planar graph into vertex-induced forestsDiscrete Applied Mathematics, 1996
- On the linear vertex‐arboricity of a planar graphJournal of Graph Theory, 1990
- On point-linear arboricity of planar graphsDiscrete Mathematics, 1988
- Some 4-valent, 3-connected, planar, almost pancyclic graphsDiscrete Mathematics, 1977
- Point-Arboricity and GirthJournal of the London Mathematical Society, 1974
- B-sets and planar mapsPacific Journal of Mathematics, 1971
- An Analogue to the Heawood Map-Colouring ProblemJournal of the London Mathematical Society, 1969
- The Point-Arboricity of Planar GraphsJournal of the London Mathematical Society, 1969