The following pages link to On uniquely 3-colorable graphs (Q1210549):
Displaying 16 items.
- The size of edge-critical uniquely 3-colorable planar graphs (Q396890) (← links)
- Defining sets and uniqueness in graph colorings: A survey (Q1299076) (← links)
- A critically chromatic graph (Q1366769) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- On uniquely \(3\)-colorable graphs. II (Q1584365) (← links)
- \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges (Q1850550) (← links)
- Algebraic characterization of uniquely vertex colorable graphs (Q2477631) (← links)
- A relation between choosability and uniquely list colorability (Q2496207) (← links)
- On 3-hued coloring of graphs (Q2927065) (← links)
- (Q3514492) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
- (Q4683143) (← links)
- (Q5206906) (← links)
- Construction of uniquely vertex k-colorable graphs with minimum possible size (Q5456311) (← links)
- Triangle-free Uniquely 3-Edge Colorable Cubic Graphs (Q5740313) (← links)
- Uniquely colorable graphs up to automorphisms (Q6160596) (← links)
