Pages that link to "Item:Q6170792"

The following pages link to Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs (Q6170792):

Displaying 11 items.

• Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863) (← links)
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
• The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
• Chromatic Number of Triangle-free Graphs With Some Forbidden Subgraphs (Q3461265) (← links)
• Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded (Q6038594) (← links)
• Polynomial bounds for chromatic number II: Excluding a star‐forest (Q6057629) (← links)
• Polynomial bounds for chromatic number. III. Excluding a double star (Q6057630) (← links)
• Coloring of some crown-free graphs (Q6063283) (← links)
• Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph (Q6144408) (← links)
• Perfect divisibility and coloring of some fork-free graphs (Q6570043) (← links)
• \( \chi \)-binding function for \((C_4, t\text{-broom}^+)\)-free graphs (Q6570047) (← links)