Characterising graphs with no subdivision of a wheel of bounded diameter

DOI10.1016/j.jctb.2023.01.004zbMath1512.05330arXiv2008.03031OpenAlexW3048133257MaRDI QIDQ6038576

Johannes Carmesin

Publication date: 2 May 2023

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

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

zbMATH Keywords

graph minorduality theoremgraph decompositionsshallow minorslocal separatorscharacterisation of graph classes

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph minors (05C83)

Cites Work

• Unnamed Item
• Unnamed Item
• Grid minors in damaged grids
• Towards a splitter theorem for internally 4-connected binary matroids
• Sparsity. Graphs, structures, and algorithms
• A minimal condition implying a special K\(_4\)-subdivision in a graph
• Forbidden minors characterization of partial 3-trees
• Graph minors. V. Excluding a planar graph
• Highly connected sets and the excluded grid theorem
• Obstruction set isolation for the gate matrix layout problem
• Towards tight(er) bounds for the excluded grid theorem
• Local 2-separators
• A characterization of partial 3-trees
• First-Order Interpretations of Bounded Expansion Classes
• Unique Colorability and Clique Minors

This page was built for publication: Characterising graphs with no subdivision of a wheel of bounded diameter