A characterization of Seymour graphs (Q5101429): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q178710 / rank
Normal rank
 
Property / author
 
Property / author: Alexandr V. Kostochka / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-59408-6_65 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1530869010 / 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: Matching theory / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:07, 30 July 2024

scientific article; zbMATH DE number 7577905
Language Label Description Also known as
English
A characterization of Seymour graphs
scientific article; zbMATH DE number 7577905

    Statements

    A characterization of Seymour graphs (English)
    0 references
    0 references
    0 references
    0 references
    30 August 2022
    0 references
    0 references
    connected undirected graph
    0 references
    T-cuts
    0 references
    Sebő's conjecture
    0 references
    0 references