The size of uniquely colorable graphs

DOI10.1016/0095-8956(90)90086-FzbMath0722.05032WikidataQ56389096 ScholiaQ56389096MaRDI QIDQ2641312

Shao-Ji Xu

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

color classesq-treeuniquely k-colourable graph G

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item, Uniquely total colorable graphs, Uniquely colorable graphs up to automorphisms, On two generalizations of the Alon-Tarsi polynomial method, A construction of uniquely colourable graphs with equal colour class sizes, Algebraic characterization of uniquely vertex colorable graphs, A relation between choosability and uniquely list colorability, Construction of uniquely vertex k-colorable graphs with minimum possible size, Defining sets and uniqueness in graph colorings: A survey, \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges, Unique list-colourability and the fixing chromatic number of graphs

Cites Work

• Uniquely colorable graphs
• On the coloring of signed graphs