Packing odd circuits in Eulerian graphs (Q1403922): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: James F. Geelen / rank
Normal rank
 
Property / author
 
Property / author: Guenin, Bertrand / rank
Normal rank
 
Property / author
 
Property / author: James F. Geelen / rank
 
Normal rank
Property / author
 
Property / author: Guenin, Bertrand / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013664277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4280139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of weakly bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial approaches to multiflow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility of Two Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Guenin's characterization of weakly bipartite 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 10:05, 6 June 2024

scientific article
Language Label Description Also known as
English
Packing odd circuits in Eulerian graphs
scientific article

    Statements