A survey on flows in graphs and matroids (Q298967): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.10.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2185242172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cycling Property for the Clutter of Odd st-Walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing odd <i>T</i>‐joins with at most two terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colouring seven-regular planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colouring eight-regular planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal length of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing six \(T\)-joins in plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-edge-colouring doublecross cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing odd circuits in Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of weakly bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility of Two Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / 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: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and multicommodity flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Odd Cuts and Plane Multicommodity Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutte's edge-colouring conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic theory of graph colorings / rank
 
Normal rank

Latest revision as of 05:33, 12 July 2024

scientific article
Language Label Description Also known as
English
A survey on flows in graphs and matroids
scientific article

    Statements

    A survey on flows in graphs and matroids (English)
    0 references
    21 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    flows
    0 references
    minimax relations
    0 references
    signed graphs
    0 references
    binary matroids
    0 references
    0 references
    0 references