Tree-like partial Hamming graphs

DOI10.7151/dmgt.1723zbMath1292.05099OpenAlexW1973264957MaRDI QIDQ2442273

Tanja Gologranc

Publication date: 2 April 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1723

zbMATH Keywords

intersection graphpartial Hamming graphexpansion proceduregated subgraphdismantlable graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (2)

There are no finite partial cubes of girth more than 6 and minimum degree at least 3 ⋮ Phylogeny numbers of generalized Hamming graphs

Cites Work

• A dynamic location problem for graphs
• Prefibers and the cartesian product of metric spaces
• Isometric embedding in products of complete graphs
• A fixed cube theorem for median graphs
• Isometric embeddings in Hamming graphs
• Superextensions and the depth of median graphs
• The retracts of Hamming graphs
• The structure of median graphs
• A convexity lemma and expansion procedures for bipartite graphs
• Bridged graphs are cop-win graphs: An algorithmic proof
• Vertex-to-vertex pursuit in a graph
• Retracts of hypercubes
• On Isometric Embeddings of Graphs
• n‐cubes and median graphs
• Quasi‐median graphs and algebras
• Arboreal structure and regular graphs of median-like classes
• Tree-like isometric subgraphs of hypercubes
• On the Addressing Problem for Loop Switching
• Partial Hamming graphs and expansion procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tree-like partial Hamming graphs