Strong complete minors in digraphs

DOI10.1017/S0963548321000390OpenAlexW3203434498MaRDI QIDQ5886331FDOQ5886331

Richard Snyder, António Girão, Maria Axenovich, Lea Weber

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)

Cites Work

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

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)