Strong complete minors in digraphs
From MaRDI portal
Publication:5886331
DOI10.1017/S0963548321000390OpenAlexW3203434498MaRDI QIDQ5886331
Richard Snyder, António Girão, Lea Weber, Maria A. Axenovich
Publication date: 31 March 2023
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.05643
Related Items
Cites Work
- Unnamed Item
- Highly linked tournaments
- Lower bound of the Hadwiger number of graphs by their average degree
- Even cycles in directed graphs
- Hadwiger's conjecture is true for almost every graph
- Extremal digraph results for topological complete subgraphs
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- The dichromatic number of a digraph
- Directed tree-width
- 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
- An extremal function for contractions of graphs
- An extremal function for digraph subcontraction
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Coloring dense digraphs
