On generalized graph colorings

DOI10.1002/jgt.3190110113zbMath0608.05035OpenAlexW1963778065MaRDI 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

Coloring of graphs and hypergraphs (05C15)

Related Items (22)

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

Cites Work

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

This page was built for publication: On generalized graph colorings