The complexity of generalized graph colorings

Discrete Applied Mathematics

Volumn 69, Issue 3, 1996, Pages 257-270

  Brown, Jason I ^a  

^a DALHOUSIE UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041538100     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(96)00096-0     Document Type: Article

References (8)

1. M.O. Albertson, R.E. Jamison, S.T. Hedetniemi and S.C. Locke, The subchromatic number of a graph, Discrete Math. 74 (1989) 33-49.
2. 4-free colourable graphs, Quaestiones Math. 13 (1990) 259-264.
3. C. Berge, Graphs and Hypergraphs (North Holland, New York, 1979).
4. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Elsevier, New York, 1976).
5. I. Broere and C. Mynhardt, Generalized colorings of outerplanar and planar graphs, in: Graph Theory with Applications to Algorithms and Computer Science (Wiley, New York, 1985) 151-161.
6. M. Browiecki and P. Mihók, On (n,P)-partitionable graphs, in: Graphs, Hypergraphs and Applications (Teubner, Leipzig, 1985) 15-18.
7. M. Browiecki and P. Mihók, Hereditary properties of graphs, in: Advances in Graph Theory (Teubner, Vishwa, 1991) 41-68.
8. J.I. Brown, A theory of generalized graph colourings, Ph. D. Thesis, Department of Mathematics, University of Toronto (1987).