ON UNIQUELY -G k-COLOURABLE GRAPHS

DOI10.1080/16073606.1992.9631706zbMath0771.05033OpenAlexW1984583517MaRDI QIDQ4034558

Jason I. Brown, Derek Gordon Corneil

Publication date: 16 May 1993

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/16073606.1992.9631706

zbMATH Keywords

clique numbergeneralized coloringforbidden monochromatic subgraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

The complexity of \(G\)-free colourability ⋮ The existence of uniquely \(-G\) colourable graphs ⋮ The complexity of generalized graph colorings ⋮ Conditional chromatic numbers with forbidden cycles

Cites Work

• Chromatic partitions of a graph
• The subchromatic number of a graph
• On generalized graph colorings
• Uniquely Colourable Graphs with Large Girth
• Uniquely Partitionable Graphs
• Graphs with unique Ramsey colorings
• A Construction of Uniquely C₄-free colourable Graphs
• On Partitioning Planar Graphs
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• Colour Classes for r-Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: ON UNIQUELY -G k-COLOURABLE GRAPHS