Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets

DOI10.1002/JGT.20128zbMATH Open1084.05041OpenAlexW4254910198MaRDI QIDQ3376695FDOQ3376695

Authors: R. Caha, Václav Koubek 

Publication date: 24 March 2006

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20128

Recommendations

• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Hamiltonicity of hypercubes with a constraint of required and faulty edges
• Hamiltonian paths with prescribed edges in hypercubes
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
• Hamiltonian cycles through prescribed edges in \(k\)-ary \(n\)-cubes

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On Oriented Embedding of the Binary Tree into the Hypercube
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (29)

• Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes
• Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
• Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
• Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
• Title not available (Why is that?)
• A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube
• Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions
• Dense sets and embedding binary trees into hypercubes
• Path coverings with prescribed ends in faulty hypercubes
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Hamiltonian laceability of hypercubes with prescribed linear forest and/or faulty edges
• Perfect matchings extend to two or more Hamiltonian cycles in hypercubes
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
• On path bipancyclicity of hypercubes
• Hamiltonian paths and cycles passing through a prescribed path in hypercubes
• A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
• Hamiltonian paths with prescribed edges in hypercubes
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Hamiltonian paths passing through prescribed edges in balanced hypercubes
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Disjoint path covers in cubes of connected graphs
• Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
• Matchings extend to Hamiltonian cycles in hypercubes with faulty edges
• Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges
• Fault-free Hamiltonian cycle including given edges in folded hypercubes with faulty edges
• Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
• Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges

This page was built for publication: Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets

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