Constructing Graphs with No Immersion of Large Complete Graphs

DOI10.1002/jgt.21770zbMath1302.05050arXiv1206.1545OpenAlexW2106414367MaRDI QIDQ2922213

Karen L. Collins, Megan E. Heenehan

Publication date: 9 October 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.1545

zbMATH Keywords

subdivisiongraph minorchromatic numberminimum degreeedge-connectivityHadwiger conjecturegraph immersionHajós conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Connectivity (05C40) Vertex degrees (05C07)

Related Items (4)

Clique immersion in graphs without a fixed bipartite graph ⋮ Clique immersion in graph products ⋮ Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs ⋮ Complete graph immersions in dense graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Immersing complete digraphs
• Tournament immersion and cutwidth
• Graph minors XXIII. Nash-Williams' immersion conjecture
• A bound on the chromatic number of a graph
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Beweis einer Abschwächung der Hadwiger-Vermutung
• Graph Coloring and the Immersion Order
• Immersing small complete graphs
• On self‐immersions of infinite graphs
• On H‐immersions
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• A weak immersion relation on graphs and its applications

This page was built for publication: Constructing Graphs with No Immersion of Large Complete Graphs