A Structure Theorem for Strong Immersions
From MaRDI portal
Publication:2825487
DOI10.1002/jgt.21990zbMath1346.05279arXiv1411.0522OpenAlexW1932763411MaRDI QIDQ2825487
Publication date: 13 October 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.0522
Related Items (5)
On objects dual to tree-cut decompositions ⋮ Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes ⋮ On clique immersions in line graphs ⋮ Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs ⋮ Bounded-depth Frege complexity of Tseitin formulas for all graphs
Cites Work
- A note on forbidding clique immersions
- A minimum degree condition forcing complete graph immersion
- The structure of graphs not admitting a fixed immersion
- Graph minors. XX: Wagner's conjecture
- Lower bound of the Hadwiger number of graphs by their average degree
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Graph minors. XVI: Excluding a non-planar graph
- The extremal function for complete minors
- Topological cliques in graphs II
- Strong Immersions and Maximum Degree
- Immersions in Highly Edge Connected Graphs
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
This page was built for publication: A Structure Theorem for Strong Immersions
