Minimum block containing a given graph

DOI10.1007/BF01224737MaRDI QIDQ1230635zbMATH OpenOpenAlexFDO

Authors Ján Plesník

Publication date 1976

Published in Archiv der Mathematik (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Multi-Terminal Network Flows
• Synthesis of a Communication Net

Cited in

(11)

• Plane augmentation of plane graphs to meet parity constraints
• Structured connectivity augmentation
• Structured connectivity augmentation
• Augmenting trees so that every three vertices lie on a cycle
• Optimal augmentation for bipartite componentwise biconnectivity in linear time
• Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract)
• Augmenting the edge connectivity of planar straight line graphs to three
• Connectivity augmentation in planar straight line graphs
• Globally linked pairs and cheapest globally rigid supergraphs
• Graph connectivity and its augmentation: Applications of MA orderings
• Augmenting plane straight-line graphs to meet parity constraints

This page was built for publication: Minimum block containing a given graph

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