Packing topological minors half‐integrally
From MaRDI portal
Publication:6134535
DOI10.1112/jlms.12633zbMath1519.05233arXiv1707.07221MaRDI QIDQ6134535
Publication date: 22 August 2023
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.07221
Integer programming (90C10) Combinatorial optimization (90C27) 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) Fractional graph theory, fuzzy graph theory (05C72)
Related Items (2)
A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three ⋮ A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups
Cites Work
- Unnamed Item
- Unnamed Item
- \(K_{6}\) minors in large 6-connected graphs
- Graph minors. XX: Wagner's conjecture
- Graph minors. XXI. graphs with unique linkages
- Graph minors. V. Excluding a planar graph
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XI: Circuits on a surface
- Piercing \(d\)-intervals
- Graph minors. XVI: Excluding a non-planar graph
- Excluding subdivisions of bounded degree graphs
- Graph minors. IX: Disjoint crossed paths
- On the conjecture of Hajos
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XII: Distance on a surface
- Graph minors. XIV: Extending an embedding
- Packing and covering immersions in 4-edge-connected graphs
- Clustered variants of Hajós' conjecture
- On Graphs Which Contain All Sparse Graphs
- Planar Graphs Have Bounded Queue-Number
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
- On Independent Circuits Contained in a Graph
- Ordering by Divisibility in Abstract Algebras
This page was built for publication: Packing topological minors half‐integrally
