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

DOI10.1016/j.endm.2017.07.055zbMath1378.05034OpenAlexW2765322311MaRDI QIDQ5915831

Diego Nicodemos, Matěj Stehlík

Publication date: 18 January 2018

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2017.07.055

zbMATH Keywords

independent setodd cyclemax-cutcubic plane graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum bipartite subgraphs of cubic triangle-free planar graphs
• Mangoes and blueberries
• Edge-disjoint odd cycles in planar graphs.
• 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