Flows in One-Crossing-Minor-Free Graphs
From MaRDI portal
Publication:4913762
DOI10.7155/jgaa.00291zbMath1261.05038MaRDI QIDQ4913762
David Eppstein, Erin Wolf Chambers
Publication date: 9 April 2013
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00291
05C35: Extremal problems in graph theory
05C83: Graph minors
05C85: Graph algorithms (graph-theoretic aspects)
05C21: Flows in graphs
Related Items
Unnamed Item, NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs, Minimum Cuts in Surface Graphs, An exponential lower bound for cut sparsifiers in planar graphs