Packing and covering odd cycles in cubic plane graphs with small faces

DOI10.1016/J.EJC.2017.08.004zbMath1371.05232arXiv1701.07748OpenAlexW2584916237WikidataQ56003535 ScholiaQ56003535MaRDI QIDQ5920132

Matěj Stehlík, Diego Nicodemos

Publication date: 10 October 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

3-connected cubic plane graph

Mathematics Subject Classification ID

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

Related Items (1)

Patches with short boundaries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum bipartite subgraphs of cubic triangle-free planar graphs
• Matching theory
• Mangoes and blueberries
• Edge-disjoint odd cycles in planar graphs.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Independent sets in triangle-free cubic planar graphs
• On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation
• On Odd Cuts and Plane Multicommodity Flows
• Finding a Maximum Cut of a Planar Graph in Polynomial Time
• Odd Cycle Transversals and Independent Sets in Fullerene Graphs
• Node-and edge-deletion NP-complete problems

This page was built for publication: Packing and covering odd cycles in cubic plane graphs with small faces