On point-linear arboricity of planar graphs

@article{Wang1988OnPA,
  title={On point-linear arboricity of planar graphs},
  author={Jianfang Wang},
  journal={Discrete Mathematics},
  year={1988},
  volume={72},
  pages={381-384}
}
The point-linear arboricity of a graph G=(V, E), written as p 0 (G), is defined as p 0 (G)=min{k | there exists a partition of V into k subsets, V=∪=1 V i such that (V i ) is a linear forest for 1 >i>k}. In this paper, we will discuss the point-linear arboricity of planar graphs and obtained following results: p 0 (G)=2 if G is a outplanar graph. p 0 (G)=4 if G is a planar graph. 

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-5 OF 5 CITATIONS

Vertex-arboricity of planar graphs without intersecting triangles

VIEW 1 EXCERPT
CITES BACKGROUND

On the vertex-arboricity of planar graphs

P-bipartitions of minor hereditary properties

VIEW 2 EXCERPTS
CITES RESULTS

Partitions of some planar graphs into two linear forests

VIEW 2 EXCERPTS
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-2 OF 2 REFERENCES

Graph theory addison-wesley

VIEW 1 EXCERPT

Kronk, The point-arboricity of planar graphs

  • H.V.G. Chartrand
  • J. London Math. Sot
  • 1969