Complete directed minors and chromatic number
From MaRDI portal
Publication:6046643
DOI10.1002/jgt.22844zbMath1522.05460OpenAlexW4282014869WikidataQ114236129 ScholiaQ114236129MaRDI QIDQ6046643
No author found.
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22844
Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Coloring digraphs with forbidden cycles
- Lower bound of the Hadwiger number of graphs by their average degree
- Degree and local connectivity in digraphs
- Subdivisions of transitive tournaments
- The dichromatic number of a digraph
- Directed tree-width
- Existence of vertices of local connectivity \(k\) in digraphs of large outdegree
- Tournaments and colouring
- Dichromatic number and forced subdivisions
- Subdivisions of digraphs in tournaments
- Coloring tournaments: from local to global
- Subdivisions in digraphs of large out-degree or large dichromatic number
- Tournament minors
- Hadwiger’s Conjecture
- The Directed Grid Theorem
- An extremal function for contractions of graphs
- An extremal function for digraph subcontraction
- On topological tournaments of order 4 in digraphs of outdegree 3
- The Directed Flat Wall Theorem
- Forcing a sparse minor
- Strong complete minors in digraphs
- Coloring dense digraphs
This page was built for publication: Complete directed minors and chromatic number
