Hamiltonian laceability of hypercubes without isometric subgraphs
type: Item
instance of: scholarly article
title: Hamiltonian laceability of hypercubes without isometric subgraphs
zbMATH Open document ID: 1353.05037
author: David Pěgřímek
author: Petr Gregor
published in: Graphs and Combinatorics
publication date: 2017-01-13T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 6674448
zbMATH Keywords: hypercube
zbMATH Keywords: Hamiltonicity
zbMATH Keywords: Hamiltonian laceability
zbMATH Keywords: isometric subgraph
zbMATH Keywords: fault tolerance
MaRDI profile type: Publication
full work available at URL: s00373-016-1728-5
OpenAlex ID: W2484443038
cites work: Q5269419
cites work: Path coverings with prescribed ends in faulty hypercubes
cites work: Distance-preserving subgraphs of hypercubes
cites work: Hamiltonian paths with prescribed edges in hypercubes
cites work: Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
cites work: On the Addressing Problem for Loop Switching
cites work: Q3575453
cites work: Q3005852
cites work: Q3582501
cites work: On Hamiltonian circuits and spanning trees of hypercubes
cites work: Long geodesics in subgraphs of the cube
cites work: Hyper-Hamilton laceable and caterpillar-spannable product graphs
cites work: A Survey of Combinatorial Gray Codes
DOI: 10.1007/S00373-016-1728-5
description: scientific article; zbMATH DE number 6674448