On metric properties of certain clique graphs
From MaRDI portal
(Redirected from Publication:1229892)
Cites work
- A Characterization of Block-Graphs
- A Characterization of Certain Ptolemaic Graphs
- A characterization of clique graphs
- A characterization of ptolemaic graphs
- A note on the metric properties of trees
- A partial characterization of clique graphs
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3377257 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
Cited in
(34)- A graph-theoretical invariant of topological spaces
- Simplicial powers of graphs
- Distance-hereditary graphs
- On hypergraph acyclicity and graph chordality
- Metric characterization of parity graphs
- Trees, taxonomy, and strongly compatible multi-state characters
- Distance labeling scheme and split decomposition
- Powers of distance-hereditary graphs
- A note on the triameter of graphs
- Linear-time algorithms for three domination-based separation problems in block graphs
- Applying clique-decomposition for computing Gromov hyperbolicity
- A linear-time algorithm for the identifying code problem on block graphs
- Antimatroids and balanced pairs
- Node-searching problem on block graphs
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel
- Lattices of regular closed subsets of closure spaces
- On the hyperbolicity of bipartite graphs and intersection graphs
- A characterization of line graphs that are squares of graphs
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Simplicial Powers of Graphs
- Graph theory (algorithmic, algebraic, and metric problems)
- \((k+1)\)-line graphs of \(k\)-trees
- Unique eccentric point graphs and their eccentric digraphs
- On three domination-based identification problems in block graphs
- On three domination-based identification problems in block graphs
- The complement of the Djoković-Winkler relation
- Inertia and spectral symmetry for the eccentricity matrices of clique trees
- Componentwise linear symbolic powers of edge ideals and Minh's conjecture
- Reconstructing a graph from the boundary distance matrix
- A characterization of uniquely representable graphs
- Multipacking and broadcast domination on cactus graphs and its impact on hyperbolic graphs
- Clique graphs and Helly graphs
- Compatible decompositions and block realizations of finite metrics
- Characterising \((k,\ell )\)-leaf powers
This page was built for publication: On metric properties of certain clique graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1229892)
