Extremal graphs in connectivity augmentation

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199907)31:3<179::AID-JGT3>3.0.CO;2-7" /><179::AID-JGT3>3.0.CO;2-7 10.1002/(SICI)1097-0118(199907)31:3<179::AID-JGT3>3.0.CO;2-7zbMath0933.05076OpenAlexW4250859470MaRDI QIDQ4256090

Tibor Jordán

Publication date: 22 March 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199907)31:3<179::aid-jgt3>3.0.co;2-7

zbMATH Keywords

extremal graphsconnectivity

Mathematics Subject Classification ID

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

Related Items (1)

Independence free graphs and vertex connectivity augmentation

Cites Work

• Unnamed Item
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• A note on the vertex-connectivity augmentation problem
• On the optimal vertex-connectivity augmentation
• Minimal edge-coverings of pairs of sets
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• On the Structure of Minimum-Weight k-Connected Spanning Networks
• The minimum augmentation of any graph to aK-edge-connected graph
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Edge-Connectivity Augmentation Preserving Simplicity
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: Extremal graphs in connectivity augmentation