On generalized graph colorings

DOI10.1002/jgt.3190110113zbMath0608.05035MaRDI QIDQ3748295

Jason I. Brown, Derek Gordon Corneil

Publication date: 1987

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190110113

zbMATH Keywords

generalized chromatic number

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

A Construction of Uniquely C₄-free colourable Graphs, Unnamed Item, On generalized perfect graphs: Bounded degree and bounded edge perfection, Polarity of chordal graphs, Minimum partition of an independence system into independent sets, Graph properties and hypergraph colourings, Chromatic partitions of a graph, Generalized partitions of graphs, A sequential coloring algorithm for finite sets, Extremal results on defective colorings of graphs, The complexity of \(G\)-free colourability, The existence of uniquely \(-G\) colourable graphs, A hypocoloring model for batch scheduling, Generalizations of independence and chromatic numbers of a graph, Conditional chromatic numbers with forbidden cycles, The subchromatic number of a graph, Generalized perfect graphs: Characterizations and inversion, The complexity of generalized graph colorings, A note on on-line ranking number of graphs, Unnamed Item, ON UNIQUELY -G k-COLOURABLE GRAPHS

Cites Work

• On critical subgraphs of colour-critical graphs
• Graph Theory and Probability
• Colour Classes for r-Graphs