Strong complete minors in digraphs

DOI10.1017/S0963548321000390OpenAlexW3203434498MaRDI QIDQ5886331FDOQ5886331

Authors António Girão, Richard Snyder, Lea Weber, Maria 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

zbMATH Keywords

digraphsstrong minors

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Complete directed minors and chromatic number
• Tournament minors
• Subdivisions of digraphs in tournaments
• Dichromatic number and forced subdivisions
• On the contractibility of a digraph onto \(K_ 4^*\)

Cites Work

• scientific article; zbMATH DE number 3102312 (Why is no real title available?)
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• An extremal function for contractions of graphs
• An extremal function for digraph subcontraction
• Coloring dense digraphs
• Coloring tournaments: from local to global
• Dichromatic number and forced subdivisions
• Directed tree-width
• Even cycles in directed graphs
• Extremal digraph results for topological complete subgraphs
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Hadwiger's conjecture is true for almost every graph
• Highly linked tournaments
• Lower bound of the Hadwiger number of graphs by their average degree
• Subdivisions in digraphs of large out-degree or large dichromatic number
• Subdivisions of digraphs in tournaments
• The dichromatic number of a digraph
• Tournament minors
• Tournaments and colouring

Cited In (4)

• Coloring hypergraphs with excluded minors
• Complete directed minors and chromatic number
• Structure of cycles in minimal strong digraphs
• Strong-diameter decompositions of minor free graphs

This page was built for publication: Strong complete minors in digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886331)