Pages that link to "Item:Q4256101"
From MaRDI portal
The following pages link to Construction of uniquely \(H\)-colorable graphs (Q4256101):
Displaying 14 items.
- A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth (Q528972) (← links)
- The good, the bad, and the great: homomorphisms and cores of random graphs (Q1045034) (← links)
- Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
- Planar graphs with circular chromatic numbers between 3 and 4 (Q1306306) (← links)
- Homomorphisms and amalgamation (Q1406546) (← links)
- On sparse graphs with given colorings and homomorphisms. (Q1425116) (← links)
- A blow-up construction and graph coloring (Q1901028) (← links)
- Strongly Projective Graphs (Q3153537) (← links)
- (Q4892340) (← links)
- The circular chromatic number of series-parallel graphs with large girth (Q4948748) (← links)
- Uniquely colorable Cayley graphs (Q5357296) (← links)
- A note on uniquely H-colorable graphs (Q5444054) (← links)
- Construction of uniquely vertex k-colorable graphs with minimum possible size (Q5456311) (← links)
- Making an H $H$‐free graph k $k$‐colorable (Q6093148) (← links)