Unimodal time-symmetric dynamics.
Bernhardt, Chris (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Bernhardt, Chris (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
V. Chitra, A. Muthusamy (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Let n ≥ 3 and ⋋ ≥ 1 be integers. Let ⋋Kn denote the complete multigraph with edge-multiplicity ⋋. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m for all even ⋋ ≥ 2 and m ≥ 2. Also we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m − F for all odd ⋋ ≥ 3 and m ≥ 2. In fact, our results together with the earlier results (by Walecki and Brualdi and Schroeder) completely settle the existence of symmetric Hamilton cycle decomposition...
John L. Simons (2008)
Acta Arithmetica
Similarity:
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edward G. Belaga (2003)
Acta Arithmetica
Similarity:
Hong Wang (2012)
Discussiones Mathematicae Graph Theory
Similarity:
We prove that if G is a graph of order 5k and the minimum degree of G is at least 3k then G contains k disjoint cycles of length 5.
Jordon, Heather (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Devra Garfinkle (1992)
Compositio Mathematica
Similarity:
E. Kolasińska (1980)
Applicationes Mathematicae
Similarity:
J. Węgrzyn (1971)
Applicationes Mathematicae
Similarity:
Walden, Byron L. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
W. Puckett (1938)
Fundamenta Mathematicae
Similarity:
B. Kaufmann (1939)
Compositio Mathematica
Similarity: