K₃,3 minors and the maximum-flow problem

MaRDI QIDQ2867319zbMATH OpenFDO

Authors Donald K. Wagner

Publication date 11 December 2013

Published in Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/4176

zbMATH Keywords

\(K_{3,3}\) minormaximum flowplanar graphs

Mathematics Subject Classification ID

Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)

Recommendations

• Graphs with no \(K_{3,3}\) minor containing a fixed edge
• Flows in one-crossing-minor-free graphs
• Flows in one-crossing-minor-free graphs
• Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
• scientific article; zbMATH DE number 1769310

Cited in

(3)

• Graphs with no \(K_{3,3}\) minor containing a fixed edge
• Flows in one-crossing-minor-free graphs
• Flows in one-crossing-minor-free graphs

This page was built for publication: \(K_{3,3}\) minors and the maximum-flow problem

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