The complexity of generalized graph colorings
- 27 August 1996
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 69 (3) , 257-270
- https://doi.org/10.1016/0166-218x(96)00096-0
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- ON UNIQUELY -G k-COLOURABLE GRAPHSQuaestiones Mathematicae, 1992
- Graph properties and hypergraph colouringsDiscrete Mathematics, 1991
- A ramsey type problem concerning vertex colouringsJournal of Combinatorial Theory, Series B, 1991
- A Construction of Uniquely C 4 -free colourable GraphsQuaestiones Mathematicae, 1990
- The subchromatic number of a graphDiscrete Mathematics, 1989
- On generalized graph coloringsJournal of Graph Theory, 1987
- Some undecidable problems involving the edge-coloring and vertex-coloring of graphsDiscrete Mathematics, 1984
- Colouring steiner quadruple systemsDiscrete Applied Mathematics, 1982
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- Colour Classes for r-GraphsCanadian Mathematical Bulletin, 1972