Disjoint dijoins for classes of dicuts in finite and infinite digraphs (Q5051459): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 2109.03518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Menger's theorem for infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint dijoins / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dijoins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed cut transversal packing for source-sink connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the infinite Lucchesi–Younger conjecture I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of infinite graphs. I: Bond-faithful decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a min-max conjecture of Woodall / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Dicycle Covers in Planar Graphs with No K 5–e Minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on disjoint dijoins / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Graphs, with an Application to a Problem of Traffic Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to a conjecture of Edmonds and Giles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max Relations for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary submodels in infinite combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5717957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3439690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172066 / rank
 
Normal rank

Latest revision as of 22:01, 30 July 2024

scientific article; zbMATH DE number 7622526
Language Label Description Also known as
English
Disjoint dijoins for classes of dicuts in finite and infinite digraphs
scientific article; zbMATH DE number 7622526

    Statements

    Disjoint dijoins for classes of dicuts in finite and infinite digraphs (English)
    0 references
    0 references
    0 references
    23 November 2022
    0 references
    Woodall conjecture
    0 references
    digraphs
    0 references
    directed cuts
    0 references
    dijoins
    0 references
    dijoin packing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references