论文信息 - On the vertex arboricity of planar graphs of diameter two - 字舞流文

On the vertex arboricity of planar graphs of diameter two

An induced forest k-partition of a graph G is a k-partition (V"1,V"2,...,V"k) of V(G) such that each G[V"i], 1=

Yuan Jinjiang | Yang Ai-feng

[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2] G. Chartrand,et al. A generalization of the chromatic number , 1968, Mathematical Proceedings of the Cambridge Philosophical Society.

[3] S. L. Hakimi,et al. A Note on the Vertex Arboricity of a Graph , 1989, SIAM J. Discret. Math..

[4] Jianfang Wang. On point-linear arboricity of planar graphs , 1988, Discret. Math..

[5] G. Chartrand,et al. The Point‐Arboricity of Planar Graphs , 1969 .

[6] Gary Chartrand,et al. The point-arboricity of a graph , 1968 .

[7] Frank Harary,et al. Graph Theory , 2016 .

[8] Riste Škrekovski. On the critical point-arboricity graphs , 2002 .

[9] Hong-Jian Lai,et al. Vertex arboricity and maximum degree , 1995, Discret. Math..

[10] John Mitchem,et al. Critical Point‐Arboritic Graphs , 1975 .

[11] R. J. Cook. Point-Arboricity and Girth , 1974 .

[12] Karen Seyffarth,et al. Maximal planar graphs of diameter two , 1989, J. Graph Theory.

[13] K. S. Poh. On the linear vertex-arboricity of a planar graph , 1990, J. Graph Theory.

[14] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[15] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[16] Susmita Sur-Kolay,et al. Efficient Algorithms for Vertex Arboricity of Planar Graphs , 1995, FSTTCS.