Pairs of edge-disjoint Hamiltonian circuits.
Branko Grünbaum, J. Malkevitch (1976)
Aequationes mathematicae
Similarity:
Branko Grünbaum, J. Malkevitch (1976)
Aequationes mathematicae
Similarity:
Tudor Zamfirescu (1971)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Ordaz, Oscar, González, Leida, Márquez, Isabel, Quiroz, Domingo (2000)
Divulgaciones Matemáticas
Similarity:
Boris Khesin (1993)
Recherche Coopérative sur Programme n°25
Similarity:
C.ST.J.A. NASH-WILLIAMS (1971)
Aequationes mathematicae
Similarity:
D. Z. Du, D. F. Hsu (1989)
Banach Center Publications
Similarity:
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...
E. Zenhder (1975)
Publications mathématiques et informatique de Rennes
Similarity:
Linda M. Lesniak (1978)
Aequationes mathematicae
Similarity:
N. Chakroun, M. Manoussakis, Y. Manoussakis (1989)
Banach Center Publications
Similarity:
W.T. Tutte (1977)
Aequationes mathematicae
Similarity:
Gary Chartrand, S. F. Kapoor (1974)
Colloquium Mathematicae
Similarity: