Pages that link to "Item:Q2641312"
From MaRDI portal
The following pages link to The size of uniquely colorable graphs (Q2641312):
Displaying 12 items.
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- Defining sets and uniqueness in graph colorings: A survey (Q1299076) (← links)
- Uniquely total colorable graphs (Q1376076) (← links)
- \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges (Q1850550) (← links)
- A construction of uniquely colourable graphs with equal colour class sizes (Q1983120) (← links)
- Algebraic characterization of uniquely vertex colorable graphs (Q2477631) (← links)
- A relation between choosability and uniquely list colorability (Q2496207) (← links)
- Unique list-colourability and the fixing chromatic number of graphs (Q2576344) (← links)
- Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
- (Q5206906) (← links)
- Construction of uniquely vertex k-colorable graphs with minimum possible size (Q5456311) (← links)
- Uniquely colorable graphs up to automorphisms (Q6160596) (← links)
