k-Blocks and Ultrablocks in Graphs

DOI10.1016/0095-8956(78)90071-0zbMath0379.05048OpenAlexW2015504211MaRDI QIDQ1247438

David W. Matula

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(78)90071-0

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (8)

On computing the 2-vertex-connected components of directed graphs ⋮ On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ Clusteranalyse - Überblick und neuere Entwicklungen ⋮ An algorithm for finding all thek-components of a digraph ⋮ Finding densest \(k\)-connected subgraphs ⋮ On robust clusters of minimum cardinality in networks ⋮ Blocks in \(k\)-connected graphs ⋮ k-connectivity in random undirected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• k-Degenerate Graphs
• k-Components, Clusters and Slicings in Graphs
• On cliques in graphs

This page was built for publication: k-Blocks and Ultrablocks in Graphs