The following pages link to (Q2993903):
Displaying 11 items.
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863) (← links)
- The chromatic number of \(\{P_5,K_4\}\)-free graphs (Q1942664) (← links)
- A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number (Q2101164) (← links)
- Extension of a list coloring problem (Q2488686) (← links)
- The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
- Polynomial bounds for chromatic number VI. Adding a four-vertex path (Q2701011) (← links)
- On chromatic number of graphs without certain induced subgraphs. (Q2918532) (← links)
- Chromatic Number of Triangle-free Graphs With Some Forbidden Subgraphs (Q3461265) (← links)
- A note on induced subtrees and chromatic number of graphs (Q5063847) (← links)
- Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree (Q6046682) (← links)
- Polynomial bounds for chromatic number II: Excluding a star‐forest (Q6057629) (← links)
