Approximate min-max relations on plane graphs

DOI10.1007/s10878-011-9440-0zbMath1275.90119OpenAlexW2038607360MaRDI QIDQ358640

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

zbMATH Keywords

cycleplane graphfeedback setapproximate min-max relation

Mathematics Subject Classification ID

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

Related Items (3)

On line graphs of subcubic triangle-free graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Jones' conjecture in subcubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate min-max relations for odd cycles in planar graphs
• The Gallai-Younger conjecture for planar graphs
• Packing directed circuits
• Edge-disjoint odd cycles in planar graphs.
• A Minimax Theorem for Directed Graphs
• On Independent Circuits Contained in a Graph

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