Approximate Min-max Relations for Odd Cycles in Planar Graphs

DOI10.1007/11496915_4MaRDI QIDQ3596358zbMATH OpenOpenAlexFDO

Authors Samuel Fiorini, Nadia Hardy, Adrian Vetta, Bruce Reed

Publication date 30 August 2007

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11496915_4

Mathematics Subject Classification ID

Paths and cycles (05C38) Programming involving graphs or networks (90C35)

Recommendations

• Approximate min-max relations for odd cycles in planar graphs
• Min-max relations for odd cycles in planar graphs
• Edge-disjoint odd cycles in planar graphs.
• Approximate min-max relations on plane graphs
• Optimal packings of edge-disjoint odd cycles

Cited in

(7)

• On the optimal transversals of the odd cycles
• Optimal packings of edge-disjoint odd cycles
• Recent techniques and results on the Erdős-Pósa property
• The ratio of the numbers of odd and even cycles in outerplanar graphs
• Approximate min-max relations on plane graphs
• Min-max relations for odd cycles in planar graphs
• Approximate min-max relations for odd cycles in planar graphs

This page was built for publication: Approximate Min-max Relations for Odd Cycles in Planar Graphs

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