Pages that link to "Item:Q4828856"

The following pages link to The chromatic number of the product of two graphs is at least half the minimum of the fractional chromatic numbers of the factors. (Q4828856):

Displaying 11 items.

• The fractional version of Hedetniemi's conjecture is true (Q648973) (← links)
• On topological relaxations of chromatic conjectures (Q710730) (← links)
• Coloring the Cartesian sum of graphs (Q998323) (← links)
• The fractional chromatic number, the Hall ratio, and the lexicographic product (Q1044943) (← links)
• On the fractional chromatic number, the chromatic number, and graph products (Q1598804) (← links)
• Sabidussi versus Hedetniemi for three variations of the chromatic number (Q1677539) (← links)
• Altermatic number of categorical product of graphs (Q1709531) (← links)
• Vector coloring the categorical product of graphs (Q2191770) (← links)
• Chromatic numbers, Sabidussi's theorem and Hedetniemi's conjecture for non-commutative graphs (Q2332386) (← links)
• The fractional chromatic number of the categorical product of graphs (Q2368592) (← links)
• Chromatic numbers and products (Q2570106) (← links)