Clique-gated graphs

DOI10.1016/0012-365X(95)00280-AzbMath0869.05054OpenAlexW2031411401MaRDI QIDQ1356418

Johann Hagauer, Sandi Klavžar

Publication date: 9 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00280-a

zbMATH Keywords

characterizationsquasi-median graphsclique-gated graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Hosoya polynomials under gated amalgamations ⋮ On clique-gated graphs

Cites Work

• A dynamic location problem for graphs
• Gated sets in metric spaces
• Isometric embeddings in Hamming graphs
• The retracts of Hamming graphs
• The structure of median graphs
• Median graphs and Helly hypergraphs
• On the complexity of recognizing Hamming graphs and related classes of graphs
• Infinite median graphs, (0, 2)-graphs, and hypercubes
• Metric Ternary Distributive Semi-Lattices
• Retracts of hypercubes
• Graphs Orientable as Distributive Lattices
• n‐cubes and median graphs
• Quasi‐median graphs and algebras
• Skeletons, recognition algorithm and distance matrix of quasi-median graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Clique-gated graphs