scientific article; zbMATH DE number 927076

DOI10.1002/(SICI)1097-0118(199608)22:4%3C293::AID-JGT2%3E3.0.CO;2-GzbMATH Open0856.05075MaRDI QIDQ4892351

Michele Conforti, Paolo Codato, Claudia Serafini

Publication date: 17 February 1997

Title of this publication is not available (Why is that?)

zbMATH Keywords

packingcut\(T\)-joinmin-max

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Packing odd T‐joins with at most two terminals

Recommendations

• Title not available (Why is that?) 👍 👎
• A note on packing of graphic \(n\)-tuples 👍 👎
• Packing six \(T\)-joins in plane graphs 👍 👎
• On shortest \(T\)-joins and packing \(T\)-cuts 👍 👎
• Two-trees optimal \(T\)-join and integral packing of \(T\)-cuts 👍 👎
• On packing \(T\)-cuts 👍 👎
• Packing of graphic n-tuples 👍 👎
• Packing odd T‐joins with at most two terminals 👍 👎
• Fractional Packing ofT-Joins 👍 👎
• On Dyadic Fractional Packings of $T$-Joins 👍 👎

This page was built for publication:

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