T‐joins intersecting small edge‐cuts in graphs

DOI10.1002/JGT.20246MaRDI QIDQ5434244zbMATH OpenOpenAlexFDO

Authors Tomáš Kaiser, Riste Škrekovski

Publication date 4 January 2008

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20246

zbMATH Keywords

\(A\)-covering join\(T\)-joincontractiongraftsmall edge-cut

Mathematics Subject Classification ID

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

Recommendations

• On packing \(T\)-cuts
• Minimum \(T\)-joins and signed-circuit covering
• scientific article; zbMATH DE number 927076
• Two-trees optimal \(T\)-join and integral packing of \(T\)-cuts
• On shortest T-joins and packing T-cuts

Cites work

• Cycles intersecting edge-cuts of prescribed sizes

Cited in

(4)

• \(T\)-joins in infinite graphs
• DisjointT-paths in tough graphs
• scientific article; zbMATH DE number 1757969 (Why is no real title available?)
• T-joins in strongly connected hypergraphs

This page was built for publication: T‐joins intersecting small edge‐cuts in graphs

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