ArticlesPartitions of Graphs into Cographs
References (29)
The complexity of G-free colourability
Discrete Math
(1997)- et al.
The subchromatic number of a graph. Graph colouring and variations
Discrete Math
(1989) - et al.
Complement reducible graphs
Discrete Appl. Math
(1981) - et al.
Some simplified NP-complete graph problems
Theor. Comput. Sci
(1976) - et al.
On cocolourings and cochromatic numbers of graphs
Discrete Appl. Math
(1994) - et al.
Colorings and girth of oriented planar graphs
Discrete Math
(1997) - et al.
A short proof of the existence of highly chromatic hypergraphs without short cycles
J. Combin. Theory Ser B
(1979) - et al.
Chromatically optimal rigid graphs
J. Combin. Theory Ser. B
(1989) On a property of the class of n-colorable graphs
J. Comb. Th. Ser. B
(1974)- et al.
Generalized colorings of outerplanar and planar graphs
Generalized colorings of graphs
Clustering and domination in perfect graphs
Discrete Appl. Math
(1984)
A linear recognition algorithm for cographs
SIAM J. Compt
(1985)
Cited by (0)
Copyright © 2002 Published by Elsevier B.V.