Packing odd circuits in Eulerian graphs

DOI10.1006/jctb.2002.2128zbMath1023.05091OpenAlexW2013664277MaRDI QIDQ1403922

James F. Geelen, Guenin, Bertrand

Publication date: 20 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/375f27fc14a0aed00b4a6b761b7f2f9c3a8cb629

zbMATH Keywords

signed graphsevenly bipartitestrongly bipartiteweakly bipartite

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Signed and weighted graphs (05C22)

Related Items

A survey on flows in graphs and matroids ⋮ Negative (and positive) circles in signed graphs: a problem collection ⋮ Clean Clutters and Dyadic Fractional Packings ⋮ Resolution of indecomposable integral flows on signed graphs ⋮ Conformal Decomposition of Integral Tensions and Potentials of Signed Graphs ⋮ A short proof of Seymour's characterization of the matroids with the max-flow min-cut property ⋮ Displaying blocking pairs in signed graphs ⋮ Ranking tournaments with no errors. II: Minimax relation ⋮ Ideal clutters ⋮ Ranking tournaments with no errors. I: Structural description ⋮ Packing circuits in matroids ⋮ Conformal decomposition of integral flows on signed graphs with outer-edges ⋮ Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial approaches to multiflow problems
• The matroids with the max-flow min-cut property
• A characterization of weakly bipartite graphs
• A short proof of Guenin's characterization of weakly bipartite graphs
• Combinatorial Optimization
• On Odd Cuts and Plane Multicommodity Flows
• Feasibility of Two Commodity Network Flows
• Multi-Commodity Network Flows