Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A quick proof of Seymour's theorem on t-joins

From MaRDI portal
Publication:1089008
Jump to:navigation, search

DOI10.1016/0012-365X(87)90246-9zbMath0618.05040OpenAlexW1975569664MaRDI QIDQ1089008

András Sebő

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90246-9


zbMATH Keywords

matchingsChinese postman toursminimum weight pathsplane multicommodity flowst-cutst-join


Mathematics Subject Classification ID

Graph theory (05C99)


Related Items

Conservative weightings and ear-decompositions of graphs ⋮ Undirected distances and the postman-structure of graphs ⋮ The Schrijver system of odd join polyhedra ⋮ On shortest \(T\)-joins and packing \(T\)-cuts ⋮ On T-joins and odd factors



Cites Work

  • Unnamed Item
  • Unnamed Item
  • On two minimax theorems in graph
  • The scholar as craftsman: Derek de Solla Price and the reconstruction of a medieval instrument
  • Covering directed and odd cuts
  • On Odd Cuts and Plane Multicommodity Flows
  • Matching, Euler tours and the Chinese postman
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1089008&oldid=13114783"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 02:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki