Graphs with no \(K_{3,3}\) minor containing a fixed edge

DOI10.1155/2013/783710zbMath1267.05222OpenAlexW1485574817WikidataQ58923558 ScholiaQ58923558MaRDI QIDQ1953665

Donald K. Wagner

Publication date: 10 June 2013

Published in: International Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/783710

zbMATH Keywords

cycleminimal cut

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Cites Work

• A decomposition of the matroids with the max-flow min-cut property
• On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
• Maximal Flow Through a Network
• Edges and Kuratowski Subgraphs of Non-Planar Graphs
• Efficient Planarity Testing
• Dividing a Graph into Triconnected Components
• Max flows in O(nm) time, or better
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs with no \(K_{3,3}\) minor containing a fixed edge