An Excluded Minor Characterization of Seymour Graphs (Q3009746): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A characterization of Seymour graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On shortest \(T\)-joins and packing \(T\)-cuts / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 2-Matchings and 2-covers of hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of the disjoint paths problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5519709 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Undirected distances and the postman-structure of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The matroids with the max-flow min-cut property / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Odd Cuts and Plane Multicommodity Flows / rank | |||
Normal rank |
Latest revision as of 05:43, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An Excluded Minor Characterization of Seymour Graphs |
scientific article |
Statements
An Excluded Minor Characterization of Seymour Graphs (English)
0 references
24 June 2011
0 references