The size of uniquely colorable graphs
From MaRDI portal
Publication:2641312
DOI10.1016/0095-8956(90)90086-FzbMath0722.05032WikidataQ56389096 ScholiaQ56389096MaRDI QIDQ2641312
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
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