The existence of uniquely \(-G\) colourable graphs

DOI10.1016/S0012-365X(97)00022-8zbMath0885.05062MaRDI QIDQ1377702

Derek Gordon Corneil, Demetrios Achlioptas, Jason I. Brown, Michael S. O. Molloy

Publication date: 24 March 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypergraph\(k\)-colourable graphuniquely colourable graph

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

The complexity of \(G\)-free colourability ⋮ Generalized Coloring of Permutations ⋮ On the complexity of generalized chromatic polynomials ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring of universal graphs
• Graph properties and hypergraph colourings
• The Ramsey property for graphs with forbidden complete subgraphs
• A Ramsey type problem concerning vertex colourings
• Chromatic partitions of a graph
• The complexity of \(G\)-free colourability
• The subchromatic number of a graph
• On generalized graph colorings
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• 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

This page was built for publication: The existence of uniquely \(-G\) colourable graphs