A characterization of Seymour graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199704)24:4<357::AID-JGT8>3.0.CO;2-N" /><357::AID-JGT8>3.0.CO;2-N 10.1002/(SICI)1097-0118(199704)24:4<357::AID-JGT8>3.0.CO;2-NzbMath0869.05051OpenAlexW2032715186MaRDI QIDQ3129829

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

Publication date: 31 August 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199704)24:4<357::aid-jgt8>3.0.co;2-n

zbMATH Keywords

characterization\(T\)-joinSeymour graph\(T\)-cutgrafit

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (3)

A characterization of minimal non-Seymour graphs ⋮ An Excluded Minor Characterization of Seymour Graphs ⋮ Vertex set partitions preserving conservativeness

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