Tree-like partial Hamming graphs

DOI10.7151/DMGT.1723MaRDI QIDQ2442273zbMATH OpenOpenAlexFDO

Authors T. Gologranc

Publication date 2 April 2014

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

dismantlable graphexpansion proceduregated subgraphintersection graphpartial Hamming graph

Mathematics Subject Classification ID

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

Recommendations

• Tree-like isometric subgraphs of hypercubes
• Partial Hamming graphs and expansion procedures
• scientific article; zbMATH DE number 3966136
• Subdivided graphs as isometric subgraphs of Hamming graphs
• Invariant Hamming graphs in infinite quasi-median graphs

Cites work

• n‐cubes and median graphs
• A convexity lemma and expansion procedures for bipartite graphs
• A dynamic location problem for graphs
• A fixed cube theorem for median graphs
• Arboreal structure and regular graphs of median-like classes
• Bridged graphs are cop-win graphs: An algorithmic proof
• scientific article; zbMATH DE number 4142072 (Why is no real title available?)
• scientific article; zbMATH DE number 3697163 (Why is no real title available?)
• scientific article; zbMATH DE number 15874 (Why is no real title available?)
• scientific article; zbMATH DE number 1339499 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• Isometric embedding in products of complete graphs
• Isometric embeddings in Hamming graphs
• On Isometric Embeddings of Graphs
• On the Addressing Problem for Loop Switching
• Partial Hamming graphs and expansion procedures
• Prefibers and the cartesian product of metric spaces
• Quasi‐median graphs and algebras
• Retracts of hypercubes
• Superextensions and the depth of median graphs
• The retracts of Hamming graphs
• The structure of median graphs
• Tree-like isometric subgraphs of hypercubes
• Vertex-to-vertex pursuit in a graph

Cited in

(3)

• Phylogeny numbers of generalized Hamming graphs
• There are no finite partial cubes of girth more than 6 and minimum degree at least 3
• Tree-like isometric subgraphs of hypercubes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442273)