On T-joins and odd factors

DOI10.1016/0167-6377(87)90027-7zbMath0625.05038OpenAlexW2077213914MaRDI QIDQ579278

Ning Qi

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90027-7

zbMATH Keywords

odd factorsperfect matching theoremT-joins

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

A separation algorithm for the matchable set polytope ⋮ \(b\)-matching degree-sequence polyhedra ⋮ On some factor theorems of graphs

Cites Work

• Unnamed Item
• On factors with all degrees odd
• A quick proof of Seymour's theorem on t-joins
• Covering directed and odd cuts
• On Odd Cuts and Plane Multicommodity Flows
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Matching, Euler tours and the Chinese postman
• The Factorization of Linear Graphs

This page was built for publication: On T-joins and odd factors