On cocolourings and cochromatic numbers of graphs
- 1 January 1994
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 48 (2) , 111-127
- https://doi.org/10.1016/0166-218x(92)00121-2
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- NP-completeness of edge-colouring some restricted graphsDiscrete Applied Mathematics, 1991
- Chromatic Number Versus Cochromatic Number in Graphs with Bounded Clique NumberEuropean Journal of Combinatorics, 1990
- Some topics in cochromatic theoryGraphs and Combinatorics, 1987
- A Linear Recognition Algorithm for CographsSIAM Journal on Computing, 1985
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Clustering and domination in perfect graphsDiscrete Applied Mathematics, 1984
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Cochromatic Number and the Genus of a GraphJournal of Graph Theory, 1979
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974