Four problems on graphs with excluded minors

DOI10.1007/BF01589109zbMath0681.90079OpenAlexW1969416565MaRDI QIDQ1823871

Ellis L. Johnson, Huiling Gan

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01589109

zbMATH Keywords

odd circuitChinese postmanbinary group problemco-postmanodd cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (4)

The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs ⋮ Packing Signatures in Signed Graphs ⋮ On the packing number of antibalanced signed simple planar graphs of negative girth at least 5 ⋮ The anti-join composition and polyhedra

Cites Work

• Unnamed Item
• Decomposition of regular matroids
• The matroids with the max-flow min-cut property
• Topology of series-parallel networks
• Invariant imbedding, particle interaction, and conservation relations
• Binary group and Chinese postman polyhedra
• Odd Minimum Cut-Sets and b-Matchings
• The Forbidden Minors of Binary Clutters
• On Four Problems in Graph Theory
• Matching, Euler tours and the Chinese postman
• A Solution of the Shannon Switching Game

This page was built for publication: Four problems on graphs with excluded minors