scientific article; zbMATH DE number 4085690

MaRDI QIDQ3815329zbMATH OpenFDO

Authors Martin Lewinter, Frank Harary

Publication date 1987

zbMATH Keywords

bipartite graphequitable Hamilton laceable graphHamilton laceablepermutation graph

Mathematics Subject Classification ID

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

Recommendations

• Minimal hyper-Hamilton laceable graphs
• scientific article; zbMATH DE number 1990709
• On the equitable \(k^{*}\)-laceability of hypercubes
• Enumeration of Hamilton paths in ladders
• Hyper-Hamilton laceable and caterpillar-spannable product graphs

Cited in

(14)

• Survey on path and cycle embedding in some networks
• Minimal hyper-Hamilton laceable graphs
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Addendum to: ``Hamilton-laceable bi-powers of locally finite bipartite graphs
• Hamilton-laceable bi-powers of locally finite bipartite graphs
• On the equitable \(k^{*}\)-laceability of hypercubes
• Cycle embedding in star graphs with edge faults
• scientific article; zbMATH DE number 6700510 (Why is no real title available?)
• Laceable knights
• Enumeration of Hamilton paths in ladders
• Fault-tolerant Hamiltonian laceability of balanced hypercubes
• Star transposition Gray codes for multiset permutations
• Hamiltonian cycle and path of folded hypercube with faulty matchings

This page was built for publication:

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