k-Blocks and Ultrablocks in Graphs

DOI10.1016/0095-8956(78)90071-0MaRDI QIDQ1247438zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• k-Components, Clusters and Slicings in Graphs
• k-Degenerate Graphs
• scientific article; zbMATH DE number 3504320 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3377257 (Why is no real title available?)
• On cliques in graphs

Cited in

(9)

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

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

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