Live briefing
Everything about Block graph
Graph whose biconnected components are all cliques
In graph theory, a branch of combinatorial mathematics, a block graph or clique tree is a type of undirected graph in which every biconnected component (block) is a clique. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Block graphA 5-minute orientation
- Skim a recent paper: Review of: "Block nanolithography Oriented copolymer is a combination of top-down lithography and the bottom-up self-organization of two polymers to produce high-resolution nanopatterns over large areas"Influential work since 2022
- Pick up a classic book: Contemporary Design TheoryThe most-reprinted book on the subject
- Read the landmark paper: Right bundle branch block, persistent ST segment elevation and sudden cardiac death: A distinct clinical and electrocardiographic syndromeCited 2,710 times
- Go sideways: Glossary of graph theoryA closely related topic
- Go sideways: Cactus graphA closely related topic
📖 Definitions
Noun A type of undirected graph in which every biconnected component (block) is a clique.
Noun A simple two-dimensional bar chart that shows amounts or quantities as blocks.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Right bundle branch block, persistent ST segment elevation and sudden cardiac death: A distinct clinical and electrocardiographic syndrome
Block Modeling-Guided Graph Convolutional Neural Networks
Graph-based Dequantization of Block-Compressed Piecewise Smooth Images
The block-cutpoint-tree of a graph
Fast iterative graph computation with block updates
On constructing a block layout by graph theory
Inverse of the distance matrix of a block graph
Attributed graph clustering with subspace stochastic block model
🆕 Influential since 2022
Review of: "Block nanolithography Oriented copolymer is a combination of top-down lithography and the bottom-up self-organization of two polymers to produce high-resolution nanopatterns over large areas"
Multi-view graph embedding clustering network: Joint self-supervision and block diagonal representation
Graph-based block-level urban change detection using Sentinel-2 time series
Complex expressional characterizations learning based on block decomposition for temporal knowledge graph completion
Parallel block Neo-Hookean XPBD using graph clustering
📚 Books worth reading
Contemporary Design TheoryJeffrey H. Dinitz, Douglas R. Stinson · 1992
Quasi-symmetric designsMohan S. Shrikhande · 1991- 📕Graphs, hypergraphs and block systemsM. Borowiecki, Zdzisław Skupień · 1976
Graphs, codes, and designsPeter J. Cameron · 1980
Graph theory, coding theory, and block designsPeter J. Cameron · 1975
Designs, graphs, codes, and their linksPeter J. Cameron · 1991
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…
- Cactus graph In graph theory, a cactus (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common. Equivalently…
- Geodetic graph In graph theory, a geodetic graph is an undirected graph such that there exists a unique (unweighted) shortest path between each two vertices. Geodetic…
- Ptolemaic graph In graph theory, a Ptolemaic graph is an undirected graph whose shortest path distances obey Ptolemy's inequality, which in turn was named after the Greek…
- Cograph In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation…
- Perfect graph In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every…
- Distance-hereditary graph In graph theory, a branch of discrete mathematics, a distance-hereditary graph (also called a completely separable graph) is a graph in which the distances…
- Peripheral cycle In graph theory, a peripheral cycle (or peripheral circuit) in an undirected graph is, intuitively, a cycle that does not separate any part of the graph…