Packing odd circuits in Eulerian graphs
type: Item
instance of: scholarly article
title: Packing odd circuits in Eulerian graphs
zbMATH Open document ID: 1023.05091
published in: Journal of Combinatorial Theory. Series B
publication date: 2003-08-20T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C22
zbMATH DE Number: 1967949
zbMATH Keywords: strongly bipartite
zbMATH Keywords: weakly bipartite
zbMATH Keywords: evenly bipartite
zbMATH Keywords: signed graphs
author: James F. Geelen
author: Bertrand Guenin
MaRDI profile type: Publication
OpenAlex ID: W2013664277
cites work: Combinatorial optimization. Packing and covering
cites work: Q4280139
cites work: A characterization of weakly bipartite graphs
cites work: Q4737527
cites work: Multi-Commodity Network Flows
cites work: Combinatorial approaches to multiflow problems
cites work: Feasibility of Two Commodity Network Flows
cites work: A short proof of Guenin's characterization of weakly bipartite graphs
cites work: The matroids with the max-flow min-cut property
cites work: On Odd Cuts and Plane Multicommodity Flows
DOI: 10.1006/JCTB.2002.2128
description: scientific article; zbMATH DE number 1967949