Pages that link to "Item:Q1063621"
From MaRDI portal
The following pages link to The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable (Q1063621):
Displaying 15 items.
- Hedetniemi's conjecture for uncountable graphs (Q509108) (← links)
- On the chromatic number and independence number of hypergraph products (Q858686) (← links)
- On multiplicative graphs and the product conjecture (Q1110530) (← links)
- Multiplicativity of acyclic local tournaments (Q1276271) (← links)
- Borel chromatic numbers (Q1279827) (← links)
- Multiplicativity of acyclic digraphs (Q1377696) (← links)
- Hadwiger's conjecture for uncountable graphs (Q1688268) (← links)
- Generic automorphisms and graph coloring (Q1772278) (← links)
- Lattices arising in categorial investigations of Hedetniemi's conjecture (Q1917488) (← links)
- Coloring graph products---a survey (Q1923489) (← links)
- Hedetniemi's conjecture is asymptotically false (Q2221935) (← links)
- A complexity problem for Borel graphs (Q2238048) (← links)
- Counterexamples to Hedetniemi's conjecture (Q2274002) (← links)
- A note on the chromatic number of the alternative negation of two graphs (Q3818335) (← links)
- Applications of Order Trees in Infinite Graphs (Q6493755) (← links)
