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 2 items.

• 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)