Tree-like partial Hamming graphs

DOI10.7151/DMGT.1723zbMATH Open1292.05099OpenAlexW1973264957MaRDI QIDQ2442273FDOQ2442273

Authors: T. 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

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

zbMATH Keywords

intersection graphpartial Hamming graphexpansion proceduregated subgraphdismantlable graph

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

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)