Pages that link to "Item:Q2701401"

The following pages link to A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401):

Displayed 3 items.

• Coloring graphs without induced \(P_5\) or \(K_5-e\) (Q6089566) ‎ (← links)
• Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs (Q6098088) ‎ (← links)
• Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) ‎ (← links)