Pages that link to "Item:Q1063620"
From MaRDI portal
The following pages link to The chromatic number of the product of two 4-chromatic graphs is 4 (Q1063620):
Displaying 13 items.
- Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings (Q3466338) (← links)
- (Q3565931) (← links)
- A note on the chromatic number of the alternative negation of two graphs (Q3818335) (← links)
- Coloring digraphs by iterated antichains (Q3990225) (← links)
- 𝜔-categorical structures avoiding height 1 identities (Q5141754) (← links)
- Minimal definable graphs of definable chromatic number at least three (Q5149654) (← links)
- Hedetniemi's Conjecture and Strongly Multiplicative Graphs (Q5244123) (← links)
- Applications of Hajós‐Type Constructions to the Hedetniemi Conjecture (Q5272936) (← links)
- My Top 10 Graph Theory Conjectures and Open Problems (Q5506779) (← links)
- Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices (Q5878469) (← links)
- On multichromatic numbers of widely colorable graphs (Q6081566) (← links)
- Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials (Q6116558) (← links)
- Acyclic coloring of products of digraphs (Q6130210) (← links)