Enumeration of hamiltonian paths in Caley diagrams.

David Housman

Displaying similar documents to “Enumeration of hamiltonian paths in Caley diagrams.”

Pairs of edge-disjoint Hamiltonian circuits.

Branko Grünbaum, J. Malkevitch (1976)

Aequationes mathematicae

Similarity:

On $k$ -path hamiltonian graphs and line-graphs

Tudor Zamfirescu (1971)

Rendiconti del Seminario Matematico della Università di Padova

Similarity:

Hamiltonian virus-free digraphs.

Ordaz, Oscar, González, Leida, Márquez, Isabel, Quiroz, Domingo (2000)

Divulgaciones Matemáticas

Similarity:

Hamiltonian Dynamics on Pseudodifferential Symbols

Boris Khesin (1993)

Recherche Coopérative sur Programme n°25

Similarity:

Hamiltonian Lines in Infinite Graphs with Few Verticles of Small Valency

C.ST.J.A. NASH-WILLIAMS (1971)

Aequationes mathematicae

Similarity:

On Hamiltonian consecutive-d digraphs

D. Z. Du, D. F. Hsu (1989)

Banach Center Publications

Similarity:

On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes

Jianxiang Cao, Minyong Shi, Lihua Feng (2016)

Discussiones Mathematicae Graph Theory

Similarity:

The balanced hypercube BHn, defined by Wu and Huang, is a variant of the hypercube network Qn, and has been proved to have better properties than Qn with the same number of links and processors. For a bipartite graph G = (V0 ∪ V1,E), we say G is edge-hyper-Hamiltonian laceable if it is Hamiltonian laceable, and for any vertex v ∈ Vi, i ∈ {0, 1}, any edge e ∈ E(G − v), there is a Hamiltonian path containing e in G − v between any two vertices of V1−i. In this paper, we prove that BHn...