Packing and Covering Immersion Models of Planar Subcubic Graphs

DOI10.1007/978-3-662-53536-3_7zbMath1417.05165OpenAlexW2267724479MaRDI QIDQ3181048

Archontia C. Giannopoulou, Jean-Florent Raymond, Dimitrios M. Thilikos, O-joung Kwon

Publication date: 22 December 2016

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: http://eprints.sztaki.hu/9057/

zbMATH Keywords

packingscoveringsgraph immersionsErdős-Pósa properties

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (2)

Recent techniques and results on the Erdős-Pósa property ⋮ \(K_4\)-expansions have the edge-Erdős-Pósa property

Cites Work

• Unnamed Item
• Unnamed Item
• An edge variant of the Erdős-Pósa property
• The Erdős-Pósa property for clique minors in highly connected graphs
• The structure of graphs not admitting a fixed immersion
• The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces
• The Erdös-Pósa property for matroid circuits
• Graph minors. V. Excluding a planar graph
• Tree-partitions of infinite graphs
• Packing directed circuits
• Edge-disjoint odd cycles in planar graphs.
• On tree-partitions of graphs
• Fixed-parameter tractability for subset feedback set problems with parity constraints
• The Erdős-Pósa property for long circuits
• Excluded Grid Theorem
• Algorithmic Applications of Tree-Cut Width
• Polynomial bounds for the grid-minor theorem
• On Independent Circuits Contained in a Graph
• Large-treewidth graph decompositions and applications
• The Erdős-Pósa property for odd cycles in highly connected graphs

This page was built for publication: Packing and Covering Immersion Models of Planar Subcubic Graphs