A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three

DOI10.1016/j.jctb.2022.01.005zbMath1483.05104arXiv2006.15694OpenAlexW3038042252MaRDI QIDQ2668021

Chun-Hung Liu

Publication date: 3 March 2022

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

structural theoremsgraph immersions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83) Connectivity (05C40) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Immersion and clustered coloring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The structure of graphs not admitting a fixed immersion
• Graph minors. XX: Wagner's conjecture
• Small graph classes and bounded expansion
• Graph minors XXIII. Nash-Williams' immersion conjecture
• Graph minors. X: Obstructions to tree-decomposition
• The asymptotic number of labeled graphs with given degree sequences
• Call routing and the ratcatcher
• Graph minors. XVI: Excluding a non-planar graph
• Excluding subdivisions of bounded degree graphs
• Random planar graphs
• Excluding any graph as a minor allows a low tree-width 2-coloring
• Packing and covering immersions in 4-edge-connected graphs
• Immersion and clustered coloring
• Tangle-tree duality in abstract separation systems
• Tangle-tree duality: in graphs, matroids and beyond
• Proper minor-closed families are small
• Clustered variants of Hajós' conjecture
• Graph Coloring and the Immersion Order
• Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
• Immersions in Highly Edge Connected Graphs
• Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
• Forcing clique immersions through chromatic number
• Counting Subgraphs via Homomorphisms
• Packing topological minors half‐integrally

This page was built for publication: A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three