Pages that link to "Item:Q2144602"

The following pages link to On the chromatic number of some \(P_5\)-free graphs (Q2144602):

Displaying 8 items.

• A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
• Perfect coloring and linearly χ-boundP6-free graphs (Q3437005) (← links)
• Coloring of some crown-free graphs (Q6063283) (← links)
• 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)
• The chromatic number of (\(P_5\), HVN)-free graphs (Q6639497) (← links)
• Non-perfect \((P_5, C_5, K_5 -e)\)-free graphs are 5-colorable (Q6660054) (← links)