A Characterization of Block-Graphs

Cited In (56)

On maximal Roman domination in graphs: complexity and algorithms
On three domination-based identification problems in block graphs
Measure preservation and integrals for Lotka-Volterra tree-systems and their Kahan discretisation
Multicore graphs: characterization and properties
On the cut-vertex and the interval transit functions of hypergraphs
Graphs with odd and even distances between non-cut vertices
The bottleneck independent domination on the classes of bipartite graphs and block graphs.
Reformulations and complexity of the clique interdiction problem by graph mapping
Single step searching in weighted block graphs
The inverse connected \(p\)-median problem on block graphs under various cost functions
Steiner Wiener index of block graphs
Fat Hoffman graphs with smallest eigenvalue greater than \(-3\)
All-path convexity: two characterizations, general position number, and one algorithm
Approximation algorithms for job scheduling with block-type conflict graphs
Block graph of a graph
Title not available (Why is that?)
A polyhedral investigation of star colorings
Block graphs in practice
Title not available (Why is that?)
Axiomatic characterization of the center function. The case of non-universal axioms
Title not available (Why is that?)
Title not available (Why is that?)
An efficient representation of chordal graphs
The scattering number of strictly chordal graphs: linear time determination
A characterization of \(n\)-component graphs
Strictly chordal graphs: structural properties and integer Laplacian eigenvalues
Tree-like structure graphs with full diversity of balls
Network verification via routing table queries
Strictly interval graphs: characterization and linear time recognition
Cut and pendant vertices and the number of connected induced subgraphs of a graph
Recognition algorithm for intersection graphs of edge disjoint paths in a tree
Graph theory
Graphs constructible from cycles and complete graphs
Antimatroids and balanced pairs
Bandwidth and density for block graphs
Title not available (Why is that?)
Two-player competitive diffusion game: graph classes and the existence of a Nash equilibrium
Exact-2-relation graphs
Leaps: an approach to the block structure of a graph
Node-searching problem on block graphs
On metric properties of certain clique graphs
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality
Going far from degeneracy
Title not available (Why is that?)
A note on the triameter of graphs
On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
The weighted perfect domination problem and its variants
On the chromatic spectrum of acyclic decompositions of graphs
\((k+1)\)-line graphs of \(k\)-trees
On pseudosimilarity in trees
Induced cycle path number of derived graphs
Enumerations, forbidden subgraph characterizations, and the split-decomposition
Max-linear graphical models with heavy-tailed factors on trees of transitive tournaments
Obstructions to a general characterization of graph correspondences
Vulnerability of subclasses of chordal graphs
On three domination-based identification problems in block graphs

This page was built for publication: A Characterization of Block-Graphs

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