Extremal graphs in connectivity augmentation

DOI10.1002/(SICI)1097-0118(199907)31:3%3C179::AID-JGT3%3E3.0.CO;2-7zbMATH Open0933.05076OpenAlexW4250859470MaRDI QIDQ4256090FDOQ4256090

Authors: Tibor Jordán 

Publication date: 22 March 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199907)31:3%3C179::aid-jgt3%3E3.0.co;2-7

Recommendations

• Connectivity augmentation of graphs
• Edge-connectivity augmentation problems
• scientific article; zbMATH DE number 1617267
• How to make a graph four-connected

zbMATH Keywords

connectivityextremal graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Augmenting weighted graphs to establish directed point-to-point connectivity
• Independence free graphs and vertex connectivity augmentation
• Hypergraph connectivity augmentation
• Successive edge-connectivity augmentation problems

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

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