k-Components, Clusters and Slicings in Graphs
From MaRDI portal
Publication:5654067
Cited in
(31)- Coloring temporal graphs
- On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs
- Covering complete \(r\)-graphs with spanning complete \(r\)-partite \(r\)-graphs
- Analysis of social networks and Wi-Fi networks by using the concept of picture fuzzy graphs
- The connectivity of generalized graph products
- The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
- A clustering algorithm based on graph connectivity
- Some applications of graph theory to clustering
- scientific article; zbMATH DE number 1251573 (Why is no real title available?)
- On \(k\)-maximal strength digraphs
- Validity of clusters formed by graph-theoretic cluster methods
- \((p,k)\)-coloring problems in line graphs
- On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs
- ON THE DICHROMATIC INDEX OF A DIGRAPH
- scientific article; zbMATH DE number 3683613 (Why is no real title available?)
- A set-theoretical approach to the problem of hierarchical clustering
- k-Blocks and Ultrablocks in Graphs
- Characterizations of strength extremal graphs
- An edge extremal result for subcohesion
- Clusteranalyse - Überblick und neuere Entwicklungen
- Data analysis implications of some concepts related to the cuts of a graph
- A graph b-coloring framework for data clustering
- On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs
- On fractional cut covers
- Covering complete hypergraphs with cuts of minimum total size
- On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
- Minimum degree orderings
- On the sizes of bi-\(k\)-maximal graphs
- On the lower bound of \(k\)-maximal digraphs
- How many circuits determine an oriented matroid?
- Large survivable nets and the generalized prisms
This page was built for publication: k-Components, Clusters and Slicings in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5654067)