Parallel complexity of partitioning a planar graph into vertex-induced forests

Authors:
Zhi-Zhong Chen;Xin He
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
1996

Citing 0
Cited 3

Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the vertex-arboricity of planar graphs

European Journal of Combinatorics
Vertex-arboricity of planar graphs without intersecting triangles

European Journal of Combinatorics

Quantified Score

Hi-index	0.06

Visualization

Abstract