The following pages link to (Q4063176):
Displayed 10 items.
- Extending the Gyárfás-Sumner conjecture (Q401488) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- First-fit coloring of bounded tolerance graphs (Q531602) (← links)
- Large induced trees in \(K_r\)-free graphs (Q1003853) (← links)
- Applications of edge coloring of multigraphs to vertex coloring of graphs (Q1121898) (← links)
- Induced subtrees in graphs of large chromatic number (Q1159679) (← links)
- Induced cycles and chromatic number (Q1306304) (← links)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186) (← links)
- Triangle-free graphs and forbidden subgraphs (Q1613361) (← links)
- Applications of hypergraph coloring to coloring graphs not inducing certain trees (Q1916109) (← links)