Minimum self-repairing graphs

DOI10.1007/BF03353012zbMath0890.05059OpenAlexW2073756966MaRDI QIDQ1376072

Andrzej Proskurowski, Arthur M. Farley

Publication date: 29 June 1998

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

characterizationtwin graphself-repairing graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (5)

Minimumk-geodetically connected digraphs ⋮ Towards minimumk-geodetically connected graphs ⋮ Minimum 3-geodetically connected graphs ⋮ Some special minimum \(k\)-geodetically connected graphs ⋮ An efficient distributed algorithm for finding all hinge vertices in networks

Cites Work

• Minimally 3-connected graphs
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Graph minors. II. Algorithmic aspects of tree-width
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum self-repairing graphs