Approximate min-max relations on plane graphs

DOI10.1007/S10878-011-9440-0zbMATH Open1275.90119OpenAlexW2038607360MaRDI QIDQ358640FDOQ358640

Authors: Jie Ma, Xingxing Yu, Wenan Zang 

Publication date: 9 August 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9440-0

Recommendations

• Min-max relations for odd cycles in planar graphs
• Approximate Min-max Relations for Odd Cycles in Planar Graphs
• Approximate min-max relations for odd cycles in planar graphs
• A note on coverings of plane graphs
• Edge-disjoint odd cycles in planar graphs.

zbMATH Keywords

cycleplane graphapproximate min-max relationfeedback set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Graph theory
• Title not available (Why is that?)
• On Independent Circuits Contained in a Graph
• Approximate min-max relations for odd cycles in planar graphs
• A Minimax Theorem for Directed Graphs
• Title not available (Why is that?)
• The Gallai-Younger conjecture for planar graphs
• Packing directed circuits
• Edge-disjoint odd cycles in planar graphs.

Cited In (9)

• Approximate Min-max Relations for Odd Cycles in Planar Graphs
• A min-max theorem for plane bipartite graphs
• Perfect Triangle Families
• On line graphs of subcubic triangle-free graphs
• A min-max relation in flowgraphs
• Optimal packings of edge-disjoint odd cycles
• On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs
• Jones' conjecture in subcubic graphs
• Recent techniques and results on the Erdős-Pósa property

This page was built for publication: Approximate min-max relations on plane graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358640)