Packing Odd Circuits

DOI10.1137/S0895480198345405MaRDI QIDQ3503215zbMATH OpenOpenAlexFDO

Authors Michele Conforti, Bert Gerards

Publication date 22 May 2008

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480198345405

zbMATH Keywords

decompositionsigned graphspackingexcluded minorsodd circuits

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph minors (05C83)

Recommendations

• Packing directed circuits
• Packing odd circuits in Eulerian graphs
• Packing directed circuits exactly
• Packing odd paths
• Odd cycle packing
• Packing directed circuits fractionally
• Packing directed circuits quarter-integrally
• Odd path packings
• Packing circuits into K_N.
• Packing circuits in matroids

Cited in

(7)

• Clutters and circuits
• A mickey-mouse decomposition theorem
• Negative (and positive) circles in signed graphs: a problem collection
• Clutters and circuits. III
• Packing odd circuits in Eulerian graphs
• On the strong metric dimension of tetrahedral diamond lattice
• Displaying blocking pairs in signed graphs

This page was built for publication: Packing Odd Circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503215)