Pages that link to "Item:Q4690990"

The following pages link to On the chromatic number of (P_{5},windmill)-free graphs (Q4690990):

Displaying 10 items.

• On the chromatic number of \(2 K_2\)-free graphs (Q1634757) (← links)
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
• Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
• On the chromatic number of some \(P_5\)-free graphs (Q2144602) (← links)
• Polynomial bounds for chromatic number VI. Adding a four-vertex path (Q2701011) (← links)
• A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
• Polynomial bounds for chromatic number II: Excluding a star‐forest (Q6057629) (← links)
• Polynomial bounds for chromatic number VII. Disjoint holes (Q6081574) (← links)
• On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676) (← links)
• Bounds for the chromatic number of some \(pK_2\)-free graphs (Q6103479) (← links)