Tree-like isometric subgraphs of hypercubes

DOI10.7151/DMGT.1199MaRDI QIDQ4823305zbMATH OpenOpenAlexFDO

Authors Boštjan Brešar, Wilfried Imrich, Sandi Klavžar

Publication date 27 October 2004

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

Full work available at URL https://dk.um.si/Dokument.php?id=110437&dn=

zbMATH Keywords

treesautomorphism groupsgraph automorphismsopen problemsmedian graphsisometric embeddingsdismantlable graphstree-like partial cubes

Mathematics Subject Classification ID

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

Recommendations

• Tree-like partial Hamming graphs
• Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. II: Fixed subgraph properties and infinite treelike partial cubes
• Partial cubes: Structures, characterizations, and constructions
• Fast recognition algorithms for classes of partial cubes
• Edge-critical isometric subgraphs of hypercubes.

Cited in

(12)

• On the decomposition of n‐cubes into isomorphic trees
• Netlike partial cubes, IV: Fixed finite subgraph theorems
• Isometric copies of directed trees in orientations of graphs
• What do trees and hypercubes have in common?
• Tree-like partial Hamming graphs
• Tiled partial cubes
• Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. II: Fixed subgraph properties and infinite treelike partial cubes
• Netlike partial cubes. I. General properties
• Θ-graphs of partial cubes and strong edge colorings
• Cube intersection concepts in median graphs
• Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor
• \(\Theta\)-graceful labelings of partial cubes

This page was built for publication: Tree-like isometric subgraphs of hypercubes

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