Embedded paths and cycles in faulty hypercubes-Reference-Cited by-同舟云学术

Embedded paths and cycles in faulty hypercubes

Published:2009-01-07 Issue:3 Volume:20 Page:224-248
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Castañeda Nelson,Gotchev Ivan S.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-008-9205-6.pdf

Reference13 articles.

1. Castañeda N, Gotchev IS (2007) Path coverings with prescribed ends in faulty hypercubes (submitted for publication)

2. Castañeda N, Gotchev IS (2008) On the hamiltonianicity of the hypercube with some deleted vertices. Preprint

3. Diestel R (2006) Graph theory, 3rd edn. Springer, Berlin

4. Dvořák T (2005) Hamiltonian cycles with prescribed edges in hypercubes. SIAM J Discrete Math 19:135–144

5. Dvořák T, Gregor P (2007) Hamiltonian paths with prescribed edges in hypercubes. Discrete Math 307:1982–1998

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Matchings in Hypercubes Extend to Long Cycles;Lecture Notes in Computer Science;2024

2. Hybrid fault-tolerant prescribed hyper-hamiltonian laceability of hypercubes;Theoretical Computer Science;2021-10

3. One-to-one disjoint path covers in hypercubes with faulty edges;The Journal of Supercomputing;2019-03-20

4. Hamiltonian laceability in hypercubes with faulty edges;Discrete Applied Mathematics;2018-02

5. Path Coverings with Prescribed Ends in Faulty Hypercubes;Graphs and Combinatorics;2014-05-03