The following pages link to (Q4892340):
Displaying 23 items.
- Triangle-free subgraphs with large fractional chromatic number (Q322348) (← links)
- A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth (Q528972) (← links)
- Dualities and dual pairs in Heyting algebras (Q603889) (← links)
- Circular total chromatic numbers of graphs (Q898151) (← links)
- Unique graph homomorphisms onto odd cycles. II (Q919003) (← 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)
- Homomorphisms and amalgamation (Q1406546) (← links)
- On sparse graphs with given colorings and homomorphisms. (Q1425116) (← links)
- Circular chromatic indices of even degree regular graphs (Q2339432) (← links)
- Cuts and bounds (Q2575795) (← links)
- Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization (Q2656903) (← links)
- An analogue of Hajós' theorem for the circular chromatic number (Q2723478) (← links)
- Construction of uniquely \(H\)-colorable graphs (Q4256101) (← links)
- (Q4944681) (← links)
- The circular chromatic number of series-parallel graphs with large girth (Q4948748) (← links)
- Subgraphs of Kneser graphs with large girth and large chromatic number (Q5058217) (← links)
- A note on uniquely H-colorable graphs (Q5444054) (← links)
- Circular Chromatic Indices of Regular Graphs (Q5495879) (← links)
- Triangle-free subgraphs with large fractional chromatic number (Q5886312) (← links)
- Construction of sparse graphs with prescribed circular colorings (Q5936037) (← links)
- Girth and λ $\lambda $‐choosability of graphs (Q6074593) (← links)
- (Q6183284) (← links)
