A Characterization of Block-Graphs

Cited in

(68)

On metric properties of certain clique graphs
Recognition algorithm for intersection graphs of edge disjoint paths in a tree
The bottleneck independent domination on the classes of bipartite graphs and block graphs.
Bandwidth and density for block graphs
Vulnerability of subclasses of chordal graphs
Axiomatic characterization of the center function. The case of non-universal axioms
Single step searching in weighted block graphs
A characterization of \(n\)-component graphs
The weighted perfect domination problem and its variants
Cut and pendant vertices and the number of connected induced subgraphs of a graph
A note on the triameter of graphs
The scattering number of strictly chordal graphs: linear time determination
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality
Exact-2-relation graphs
On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
Graphs constructible from cycles and complete graphs
Block graphs in practice
An efficient representation of chordal graphs
Antimatroids and balanced pairs
Node-searching problem on block graphs
A polyhedral investigation of star colorings
Obstructions to a general characterization of graph correspondences
scientific article; zbMATH DE number 5871993 (Why is no real title available?)
Strictly interval graphs: characterization and linear time recognition
Two-player competitive diffusion game: graph classes and the existence of a Nash equilibrium
scientific article; zbMATH DE number 5287649 (Why is no real title available?)
Fat Hoffman graphs with smallest eigenvalue greater than -3
scientific article; zbMATH DE number 3513799 (Why is no real title available?)
Tree-like structure graphs with full diversity of balls
scientific article; zbMATH DE number 7011451 (Why is no real title available?)
scientific article; zbMATH DE number 205335 (Why is no real title available?)
Steiner Wiener index of block graphs
Block graph of a graph
Going far from degeneracy
Going far from degeneracy
Induced cycle path number of derived graphs
On the chromatic spectrum of acyclic decompositions of graphs
Leaps: an approach to the block structure of a graph
Graph theory
\((k+1)\)-line graphs of \(k\)-trees
On three domination-based identification problems in block graphs
Strictly chordal graphs: structural properties and integer Laplacian eigenvalues
Max-linear graphical models with heavy-tailed factors on trees of transitive tournaments
Reformulations and complexity of the clique interdiction problem by graph mapping
All-path convexity: two characterizations, general position number, and one algorithm
Approximation algorithms for job scheduling with block-type conflict graphs
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
Enumerations, forbidden subgraph characterizations, and the split-decomposition
Classification of unmixed parity binomial edge ideals of cactus and chordal graphs
Associative triples and homomorphisms between travel groupoids on finite geodetic graphs
Linear time algorithms for colorful 3-rainbow domination in block and cactus graphs
On all-path convex, gated and Chebyshev sets in graphs
Graphs with parity conditions on distances between cut and noncut vertices
Line digraphs of polytrees
Diameter of orientations of graphs with given order and number of blocks
Chromatic choosability for some classes of perfect graphs
A characterization of uniquely representable graphs
Primitive, edge-short, isometric, and pantochordal cycles
The total interval number of a graph. III: Tree-like graphs.
Algorithmic results on independent Roman \(\{2\}\)-domination
Network verification via routing table queries
On pseudosimilarity in trees
The inverse connected p-median problem on block graphs under various cost functions

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)