Approximate min-max relations on plane graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1953101 (Why is no real title available?)
- scientific article; zbMATH DE number 3215864 (Why is no real title available?)
- A Minimax Theorem for Directed Graphs
- Approximate min-max relations for odd cycles in planar graphs
- Edge-disjoint odd cycles in planar graphs.
- Graph theory
- On Independent Circuits Contained in a Graph
- Packing directed circuits
- The Gallai-Younger conjecture for planar graphs
Cited in
(10)- Perfect Triangle Families
- On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs
- Min-max relations for odd cycles in planar graphs
- Approximate Min-max Relations for Odd Cycles in Planar Graphs
- On line graphs of subcubic triangle-free graphs
- Recent techniques and results on the Erdős-Pósa property
- A min-max theorem for plane bipartite graphs
- Optimal packings of edge-disjoint odd cycles
- A min-max relation in flowgraphs
- Jones' conjecture in subcubic graphs
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)