Pages that link to "Item:Q5092372"
From MaRDI portal
The following pages link to Colouring H-free graphs of bounded diameter. (Q5092372):
Displaying 10 items.
- Hard problems that quickly become very easy (Q2059897) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- Faster 3-Coloring of Small-Diameter Graphs (Q5866453) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5925554) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5925681) (← links)
