The following pages link to Colorful induced subgraphs (Q1197025):
Displaying 11 items.
- Induced colorful trees and paths in large chromatic graphs (Q504985) (← links)
- Induced subgraphs of graphs with large chromatic number. XI. Orientations (Q1633601) (← links)
- Applications of hypergraph coloring to coloring graphs not inducing certain trees (Q1916109) (← links)
- Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
- Structure and colour in triangle-free graphs (Q2034076) (← links)
- A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number (Q2101164) (← links)
- Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths (Q2363116) (← links)
- On induced colourful paths in triangle-free graphs (Q5915804) (← links)
- The balanced connected subgraph problem (Q5918764) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
- Variants of the Gyárfás-Sumner conjecture: oriented trees and rainbow paths (Q6642519) (← links)