Pages that link to "Item:Q1425111"
From MaRDI portal
The following pages link to Edge-disjoint odd cycles in planar graphs. (Q1425111):
Displaying 21 items.
- Approximate min-max relations on plane graphs (Q358640) (← links)
- Packing and covering tetrahedra (Q385147) (← links)
- The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces (Q868342) (← links)
- Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
- Packing edge-disjoint cycles in graphs and the cyclomatic number (Q968414) (← links)
- Edge-disjoint odd cycles in graphs with small chromatic numbers (Q1296141) (← links)
- Negative (and positive) circles in signed graphs: a problem collection (Q1643910) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- Optimal packings of edge-disjoint odd cycles (Q1969787) (← links)
- Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← links)
- Critical graphs for the chromatic edge-stability number (Q2174589) (← links)
- Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Planar graph bipartization in linear time (Q2482113) (← links)
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q2904762) (← links)
- Packing and Covering Immersion Models of Planar Subcubic Graphs (Q3181048) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation (Q5041741) (← links)
- (Q5206406) (← links)
- Packing and covering odd cycles in cubic plane graphs with small faces (Q5915831) (← links)
- Packing and covering odd cycles in cubic plane graphs with small faces (Q5920132) (← links)
