Pages that link to "Item:Q6081401"

The following pages link to Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path (Q6081401):

Displaying 9 items.

• Coloring of some crown-free graphs (Q6063283) (← links)
• On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676) (← links)
• A note on the Gyárfás-Sumner conjecture (Q6121918) (← links)
• Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
• Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs (Q6138779) (← links)
• Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph (Q6144408) (← links)
• \( \chi \)-binding function for \((C_4, t\text{-broom}^+)\)-free graphs (Q6570047) (← links)
• Structure of some \(( P_7, C_4)\)-free graphs with application to colorings (Q6611001) (← links)
• Polynomial bounds for chromatic number. VIII: Excluding a path and a complete multipartite graph (Q6642504) (← links)