Hamiltonian laceability of hypercubes without isometric subgraphs

DOI10.1007/S00373-016-1728-5zbMath1353.05037OpenAlexW2484443038MaRDI QIDQ503653

Petr Gregor, David Pěgřímek

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

zbMATH Keywords

hypercubefault toleranceHamiltonicityHamiltonian laceabilityisometric subgraph

Mathematics Subject Classification ID

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

Related Items (1)

A GENERAL POSITION PROBLEM IN GRAPH THEORY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Path coverings with prescribed ends in faulty hypercubes
• Hamiltonian paths with prescribed edges in hypercubes
• Long geodesics in subgraphs of the cube
• Distance-preserving subgraphs of hypercubes
• On Hamiltonian circuits and spanning trees of hypercubes
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• A Survey of Combinatorial Gray Codes
• On the Addressing Problem for Loop Switching

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