Half-integral linkages in highly connected directed graphs (Q5111723): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Highly connected sets and the excluded grid theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Half-integral linkages in highly connected directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm for Finding Cycles Through Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Directed Grid Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Disjoint Paths in a Directed Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly connected non-2-linked digraphs / rank
 
Normal rank

Latest revision as of 19:30, 22 July 2024

scientific article; zbMATH DE number 7205014
Language Label Description Also known as
English
Half-integral linkages in highly connected directed graphs
scientific article; zbMATH DE number 7205014

    Statements