A Characterization of Block-Graphs
From MaRDI portal
Publication:3851097
Cited in
(56)- The bottleneck independent domination on the classes of bipartite graphs and block graphs.
- The inverse connected p-median problem on block graphs under various cost functions
- Single step searching in weighted block graphs
- On three domination-based identification problems in block graphs
- Reformulations and complexity of the clique interdiction problem by graph mapping
- 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
- scientific article; zbMATH DE number 205335 (Why is no real title available?)
- A polyhedral investigation of star colorings
- Block graphs in practice
- scientific article; zbMATH DE number 7011451 (Why is no real title available?)
- Axiomatic characterization of the center function. The case of non-universal axioms
- scientific article; zbMATH DE number 5871993 (Why is no real title available?)
- scientific article; zbMATH DE number 7525484 (Why is no real title available?)
- On maximal Roman domination in graphs: complexity and algorithms
- An efficient representation of chordal graphs
- The scattering number of strictly chordal graphs: linear time determination
- On three domination-based identification problems in block graphs
- A characterization of \(n\)-component graphs
- Strictly chordal graphs: structural properties and integer Laplacian eigenvalues
- Network verification via routing table queries
- Measure preservation and integrals for Lotka-Volterra tree-systems and their Kahan discretisation
- Multicore graphs: characterization and properties
- Strictly interval graphs: characterization and linear time recognition
- Tree-like structure graphs with full diversity of balls
- 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
- Graphs constructible from cycles and complete graphs
- Graph theory
- Antimatroids and balanced pairs
- Bandwidth and density for block graphs
- scientific article; zbMATH DE number 3513799 (Why is no real title available?)
- Two-player competitive diffusion game: graph classes and the existence of a Nash equilibrium
- Exact-2-relation graphs
- On metric properties of certain clique graphs
- Node-searching problem on block graphs
- Leaps: an approach to the block structure of a graph
- The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality
- Going far from degeneracy
- scientific article; zbMATH DE number 5287649 (Why is no real title available?)
- 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 pseudosimilarity in trees
- On the chromatic spectrum of acyclic decompositions of graphs
- \((k+1)\)-line graphs of \(k\)-trees
- 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
- Induced cycle path number of derived graphs
- Obstructions to a general characterization of graph correspondences
- Max-linear graphical models with heavy-tailed factors on trees of transitive tournaments
- Vulnerability of subclasses of chordal 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)