A characterization of Seymour graphs

DOI10.1007/3-540-59408-6_65zbMath1501.05010OpenAlexW1530869010MaRDI QIDQ5101429

Zoltán Szigeti, A. A. Ageev, Alexandr V. Kostochka

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_65

zbMATH Keywords

connected undirected graphT-cutsSebő's conjecture

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40)

Cites Work

• Matching theory
• Undirected distances and the postman-structure of graphs
• On shortest \(T\)-joins and packing \(T\)-cuts
• The matroids with the max-flow min-cut property
• On Odd Cuts and Plane Multicommodity Flows

This page was built for publication: A characterization of Seymour graphs