Pages that link to "Item:Q2151188"
From MaRDI portal
The following pages link to The chromatic number of the product of 14-chromatic graphs can be 13 (Q2151188):
Displaying 8 items.
- The chromatic number of the product of two 4-chromatic graphs is 4 (Q1063620) (← links)
- On Hedetniemi's conjecture and the colour template scheme (Q1613520) (← links)
- Hedetniemi's conjecture and fiber products of graphs (Q1928633) (← links)
- Counterexamples to Hedetniemi's conjecture with large fractional chromatic numbers (Q2084794) (← links)
- Relatively small counterexamples to Hedetniemi's conjecture (Q2221923) (← links)
- Hedetniemi's conjecture is asymptotically false (Q2221935) (← links)
- Counterexamples to Hedetniemi's conjecture (Q2274002) (← links)
- Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices (Q5878469) (← links)