Hamiltonian laceability of hypercubes without isometric subgraphs

DOI10.1007/S00373-016-1728-5zbMATH Open1353.05037OpenAlexW2484443038MaRDI QIDQ503653FDOQ503653

Authors: David Pěgřímek, Petr Gregor 

Publication date: 13 January 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-016-1728-5

Recommendations

• Hamiltonicity of hypercubes with faulty vertices
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes
• Fault-tolerant Hamiltonian laceability of balanced hypercubes
• Hamiltonian laceability in hypercubes with faulty edges

zbMATH Keywords

hypercubefault toleranceHamiltonicityHamiltonian laceabilityisometric subgraph

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cites Work

• On the Addressing Problem for Loop Switching
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Handbook of product graphs
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Distance-preserving subgraphs of hypercubes
• A Survey of Combinatorial Gray Codes
• Hamiltonian paths with prescribed edges in hypercubes
• On Hamiltonian circuits and spanning trees of hypercubes
• Long cycles in hypercubes with distant faulty vertices
• Path coverings with prescribed ends in faulty hypercubes
• Long geodesics in subgraphs of the cube
• Hamiltonicity in vertex-deleted hypercubes
• Proof of Locke's conjecture. I

Cited In (4)

• Proof of Locke's conjecture. I
• Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes
• A general position problem in graph theory
• Title not available (Why is that?)

This page was built for publication: Hamiltonian laceability of hypercubes without isometric subgraphs

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