Pages that link to "Item:Q512863"

The following pages link to Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863):

Displaying 6 items.

• A note on the \(m\)-bounded chromatic number of a tree (Q685308) (← links)
• A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number (Q2101164) (← links)
• The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• Chromatic Number of Triangle-free Graphs With Some Forbidden Subgraphs (Q3461265) (← links)
• Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs (Q6170792) (← links)