Excluding subdivisions of bounded degree graphs

DOI10.1016/j.jctb.2018.05.001zbMath1402.05150arXiv1407.4428OpenAlexW2964167218MaRDI QIDQ1633742

Chun-Hung Liu, Robin Thomas

Publication date: 20 December 2018

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

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

zbMATH Keywords

structure theoremgraph subdivisionexcluded subdivision theorem

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Clustered variants of Hajós' conjecture ⋮ A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three ⋮ Packing topological minors half‐integrally ⋮ Recent Progress on Well-Quasi-ordering Graphs

Cites Work

• Graph minors. X: Obstructions to tree-decomposition
• Excluding a countable clique
• Graph minors. XI: Circuits on a surface
• Graph minors. XVI: Excluding a non-planar graph
• Graph minors. IX: Disjoint crossed paths
• Graph minors. XIII: The disjoint paths problem
• Graph minors. XII: Distance on a surface
• Graph minors. XIV: Extending an embedding
• Important Separators and Parameterized Algorithms
• Immersions in Highly Edge Connected Graphs
• Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs

This page was built for publication: Excluding subdivisions of bounded degree graphs