Pages that link to "Item:Q2113346"

The following pages link to Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346):

Displaying 12 items.

• First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs (Q968185) (← links)
• On graphs without \(P_ 5\) and \(\overline {P}_ 5\) (Q1903716) (← links)
• Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs (Q2124227) (← links)
• Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
• A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
• THE CHROMATIC NUMBER OF -FREE GRAPHS (Q6046762) (← links)
• On graphs with no induced five‐vertex path or paraglider (Q6055942) (← 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)
• On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs (Q6102271) (← links)
• Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
• The chromatic number of (\(P_5\), HVN)-free graphs (Q6639497) (← links)