Complete directed minors and chromatic number
From MaRDI portal
Publication:6046643
Recommendations
Cites work
- scientific article; zbMATH DE number 3865318 (Why is no real title available?)
- scientific article; zbMATH DE number 3102312 (Why is no real title available?)
- An extremal function for contractions of graphs
- An extremal function for digraph subcontraction
- Coloring dense digraphs
- Coloring digraphs with forbidden cycles
- Coloring tournaments: from local to global
- Degree and local connectivity in digraphs
- Dichromatic number and forced subdivisions
- Directed tree-width
- Existence of vertices of local connectivity \(k\) in digraphs of large outdegree
- Forcing a sparse minor
- Hadwiger's conjecture
- Lower bound of the Hadwiger number of graphs by their average degree
- On topological tournaments of order 4 in digraphs of outdegree 3
- Strong complete minors in digraphs
- Subdivisions in digraphs of large out-degree or large dichromatic number
- Subdivisions of digraphs in tournaments
- Subdivisions of transitive tournaments
- The Directed Flat Wall Theorem
- The dichromatic number of a digraph
- The directed grid theorem
- Tournament minors
- Tournaments and colouring
Cited in
(3)
This page was built for publication: Complete directed minors and chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046643)