Construction of uniquely vertex k-colorable graphs with minimum possible size

DOI10.1007/s11741-007-0502-3zbMath1156.05316OpenAlexW2078754575MaRDI QIDQ5456311

Min Zhao, Li-ying Kang

Publication date: 4 April 2008

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-007-0502-3

zbMATH Keywords

\(k\)-colorableuniquely vertex \(k\)-colorable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

On two generalizations of the Alon-Tarsi polynomial method

Cites Work

• On uniquely 3-colorable graphs
• Uniquely colorable graphs
• \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
• The size of uniquely colorable graphs
• Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs