A Characterization of Block-Graphs
From MaRDI portal
Publication:3851097
DOI10.4153/CMB-1963-001-xzbMath0112.25002MaRDI QIDQ3851097
Publication date: 1963
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Related Items (40)
Unnamed Item ⋮ Graphs constructible from cycles and complete graphs ⋮ The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ A polyhedral investigation of star colorings ⋮ Induced cycle path number of derived graphs ⋮ Single step searching in weighted block graphs ⋮ The scattering number of strictly chordal graphs: linear time determination ⋮ Strictly interval graphs: characterization and linear time recognition ⋮ Tree-Like Structure Graphs with Full Diversity of Balls ⋮ A characterization of \(n\)-component graphs ⋮ The weighted perfect domination problem and its variants ⋮ The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality ⋮ Fat Hoffman graphs with smallest eigenvalue greater than \(-3\) ⋮ On three domination-based identification problems in block graphs ⋮ Exact-2-relation graphs ⋮ Strictly chordal graphs: structural properties and integer Laplacian eigenvalues ⋮ Unnamed Item ⋮ Going Far from Degeneracy ⋮ The bottleneck independent domination on the classes of bipartite graphs and block graphs. ⋮ An efficient representation of chordal graphs ⋮ Antimatroids and balanced pairs ⋮ Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium ⋮ Enumerations, forbidden subgraph characterizations, and the split-decomposition ⋮ Node-searching problem on block graphs ⋮ Vulnerability of subclasses of chordal graphs ⋮ Axiomatic characterization of the center function. The case of non-universal axioms ⋮ On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs ⋮ Unnamed Item ⋮ On the chromatic spectrum of acyclic decompositions of graphs ⋮ On metric properties of certain clique graphs ⋮ Graph theory ⋮ Steiner Wiener index of block graphs ⋮ Cut and pendant vertices and the number of connected induced subgraphs of a graph ⋮ Network verification via routing table queries ⋮ Граф блоков ⋮ A note on the triameter of graphs ⋮ Unnamed Item ⋮ Bandwidth and density for block graphs ⋮ On pseudosimilarity in trees ⋮ Recognition algorithm for intersection graphs of edge disjoint paths in a tree
This page was built for publication: A Characterization of Block-Graphs
