On metric properties of certain clique graphs
From MaRDI portal
Publication:1229892
DOI10.1016/0095-8956(79)90069-8zbMATH Open0337.05138OpenAlexW2081231398MaRDI QIDQ1229892FDOQ1229892
Authors: Edward Howorka 
Publication date: 1979
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(79)90069-8
Cites Work
- A note on the metric properties of trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Characterization of Block-Graphs
- A characterization of ptolemaic graphs
- A partial characterization of clique graphs
- A characterization of clique graphs
- A Characterization of Certain Ptolemaic Graphs
- Title not available (Why is that?)
Cited In (29)
- Unique eccentric point graphs and their eccentric digraphs
- A characterization of line graphs that are squares of graphs
- Compatible decompositions and block realizations of finite metrics
- A graph-theoretical invariant of topological spaces
- Simplicial powers of graphs
- On hypergraph acyclicity and graph chordality
- Graph theory (algorithmic, algebraic, and metric problems)
- Distance-hereditary graphs
- On three domination-based identification problems in block graphs
- Distance labeling scheme and split decomposition
- Lattices of regular closed subsets of closure spaces
- Clique graphs and Helly graphs
- On the hyperbolicity of bipartite graphs and intersection graphs
- A linear-time algorithm for the identifying code problem on block graphs
- Applying clique-decomposition for computing Gromov hyperbolicity
- Characterising \((k,\ell )\)-leaf powers
- Antimatroids and balanced pairs
- Linear-time algorithms for three domination-based separation problems in block graphs
- Node-searching problem on block graphs
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel
- Simplicial Powers of Graphs
- Metric characterization of parity graphs
- A note on the triameter of graphs
- The complement of the Djoković-Winkler relation
- Powers of distance-hereditary graphs
- \((k+1)\)-line graphs of \(k\)-trees
- Trees, taxonomy, and strongly compatible multi-state characters
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- On three domination-based identification problems in block graphs
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)
