Long cycles in hypercubes with optimal number of faulty vertices
type: Item
instance of: scholarly article
title: Long cycles in hypercubes with optimal number of faulty vertices
zbMATH Open document ID: 1261.90070
author: Jiří Fink
author: Petr Gregor
published in: Journal of Combinatorial Optimization
publication date: 2013-01-03T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6121568
zbMATH Keywords: hypercube
zbMATH Keywords: faulty vertices
zbMATH Keywords: long cycle
MaRDI profile type: Publication
OpenAlex ID: W2075372248
cites work: Long paths in hypercubes with a quadratic number of faults
cites work: Computational complexity of long paths and cycles in faulty hypercubes
cites work: Gray codes with bounded weights
cites work: Long paths and cycles in hypercubes with faulty vertices
cites work: Fault-tolerant cycle embedding in the hypercube
cites work: Longest fault-free paths in hypercubes with vertex faults
cites work: Long paths in hypercubes with conditional node-faults
cites work: Hyper-Hamilton laceable and caterpillar-spannable product graphs
cites work: Embedding a ring in a hypercube with both faulty links and faulty nodes
cites work: Survey on path and cycle embedding in some networks
DOI: 10.1007/S10878-011-9379-1
description: scientific article; zbMATH DE number 6121568