Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs

DOI10.1137/S0895480196304994zbMath0999.05034MaRDI QIDQ2753535

Amir Daneshgar

Publication date: 11 November 2001

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

zbMATH Keywords

clique numberuniquely vertex colorable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item, Construction of uniquely vertex k-colorable graphs with minimum possible size, A characterization of uniquely vertex colorable graphs using minimal defining sets, Defining sets and uniqueness in graph colorings: A survey, Function simulation, graph grammars and colourings, Unique list-colourability and the fixing chromatic number of graphs, On cylindrical graph construction and its applications