Constrained Edge-Splitting Problems

DOI10.1137/S0895480199364483zbMath1038.05032OpenAlexW1981743701MaRDI QIDQ4443123

Tibor Jordán

Publication date: 8 January 2004

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

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

zbMATH Keywords

graph algorithmspolymatroidsedge-connectivitygraph augmentationsplitting sequences

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (2)

Edge-Connectivity Augmentations of Graphs and Hypergraphs ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs

This page was built for publication: Constrained Edge-Splitting Problems