How to make a graph four-connected

DOI10.1007/s101070050039zbMath0931.05043OpenAlexW2153998831MaRDI QIDQ1300060

Tibor Jordán, Ervin Gyoeri

Publication date: 16 February 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050039

zbMATH Keywords

connectivityaugmentation problemear decomposition theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (1)

Independence free graphs and vertex connectivity augmentation

This page was built for publication: How to make a graph four-connected