\(K_r\)-free uniquely vertex colorable graphs with minimum possible edges

DOI10.1006/jctb.2000.2028zbMath1027.05040OpenAlexW2050101460MaRDI QIDQ1850550

B. S. Sadjad, Vahab S. Mirrokni, Saieed Akbari

Publication date: 10 December 2002

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

Full work available at URL: https://doi.org/10.1006/jctb.2000.2028

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item, 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

Cites Work

• On uniquely 3-colorable graphs
• The size of uniquely colorable graphs
• Uniquely Colourable Graphs with Large Girth
• Uniquely colorable graphs
• Unnamed Item
• Unnamed Item