On uniquely 3-colorable graphs
From MaRDI portal
Publication:1210549
DOI10.1016/0012-365X(93)90220-NzbMath0780.05021MaRDI QIDQ1210549
Publication date: 30 August 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
Related Items
Defining sets and uniqueness in graph colorings: A survey, A critically chromatic graph, A bibliography on chromatic polynomials, On uniquely \(3\)-colorable graphs. II, \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
Cites Work