Fault-Free Pairwise Independent Hamiltonian Paths on Faulty Hypercubes

Advances in Computer Systems Architecture - Lecture Notes in Computer Science ◽

10.1007/11859802_32 ◽

2006 ◽

pp. 373-379

Author(s):

Sun-Yuan Hsieh

Keyword(s):

Hamiltonian Paths

Download Full-text

Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments

Discrete Mathematics ◽

10.1016/j.disc.2003.07.013 ◽

2004 ◽

Vol 281 (1-3) ◽

pp. 267-276 ◽

Cited By ~ 5

Author(s):

Lutz Volkmann ◽

Anders Yeo

Keyword(s):

Hamiltonian Paths ◽

Multipartite Tournaments

Download Full-text

Hamiltonian paths and hamiltonian connectivity in graphs

Discrete Mathematics ◽

10.1016/0012-365x(93)90555-8 ◽

1993 ◽

Vol 121 (1-3) ◽

pp. 223-228 ◽

Cited By ~ 4

Author(s):

Bing Wei

Keyword(s):

Hamiltonian Paths ◽

Hamiltonian Connectivity

Download Full-text

Construction of spectral invariants of Hamiltonian paths on closed symplectic manifolds

Progress in Mathematics - The Breadth of Symplectic and Poisson Geometry ◽

10.1007/0-8176-4419-9_18 ◽

2007 ◽

pp. 525-570 ◽

Cited By ~ 21

Author(s):

Yong-Geun Oh

Keyword(s):

Symplectic Manifolds ◽

Spectral Invariants ◽

Hamiltonian Paths

Download Full-text

Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars

Discussiones Mathematicae Graph Theory ◽

10.7151/dmgt.2153 ◽

2020 ◽

Vol 40 (3) ◽

pp. 823

Author(s):

Zhen-Chun Chen ◽

Hung-Chih Lee

Keyword(s):

Complete Graph ◽

Hamiltonian Paths

Download Full-text

Length minimizing Hamiltonian paths for symplectically aspherical manifolds

Annales de l’institut Fourier ◽

10.5802/aif.1986 ◽

2003 ◽

Vol 53 (5) ◽

pp. 1503-1526 ◽

Cited By ~ 12

Author(s):

Ely Kerman ◽

François Lalonde

Keyword(s):

Hamiltonian Paths ◽

Aspherical Manifolds ◽

Symplectically Aspherical

Download Full-text

Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position

Information Processing Letters ◽

10.1016/j.ipl.2008.02.013 ◽

2008 ◽

Vol 107 (5) ◽

pp. 171-176 ◽

Cited By ~ 9

Author(s):

Chung-Meng Lee ◽

Jimmy J.M. Tan ◽

Lih-Hsing Hsu

Keyword(s):

Fixed Position ◽

Hamiltonian Paths

Download Full-text

Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-030-79987-8_35 ◽

2021 ◽

pp. 501-515

Author(s):

Rahnuma Islam Nishat ◽

Venkatesh Srinivasan ◽

Sue Whitesides

Keyword(s):

Rectangular Grid ◽

Hamiltonian Paths ◽

Grid Graphs

Download Full-text

Ranking algorithms for Hamiltonian paths in hypercubic networks

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Interconnection Networks and Mapping and Scheduling Parallel Computations ◽

10.1090/dimacs/021/01 ◽

1995 ◽

pp. 1-7 ◽

Cited By ~ 3

Author(s):

Fred Annexstein

Keyword(s):

Hamiltonian Paths ◽

Ranking Algorithms

Download Full-text

Hamiltonian paths containing a given arc, in almost regular bipartite tournaments

Discrete Mathematics ◽

10.1016/j.disc.2004.02.016 ◽

2004 ◽

Vol 285 (1-3) ◽

pp. 359-364 ◽

Cited By ~ 4

Author(s):

Lutz Volkmann

Keyword(s):

Hamiltonian Paths

Download Full-text

On Cayley Digraphs That Do Not Have Hamiltonian Paths

International Journal of Combinatorics ◽

10.1155/2013/725809 ◽

2013 ◽

Vol 2013 ◽

pp. 1-7 ◽

Cited By ~ 1

Author(s):

Dave Witte Morris

Keyword(s):

Finite Group ◽

Hamiltonian Path ◽

Infinite Family ◽

Hamiltonian Paths ◽

Cayley Digraph

We construct an infinite family {Cay→(Gi;ai;bi)} of connected, 2-generated Cayley digraphs that do not have hamiltonian paths, such that the orders of the generators ai and bi are unbounded. We also prove that if G is any finite group with |[G,G]|≤3, then every connected Cayley digraph on G has a hamiltonian path (but the conclusion does not always hold when |[G,G]|=4 or 5).

Download Full-text