Interchangeability of relevant cycles in graphs.
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ralph Faudree, Annette Schelten, Ingo Schiermeyer (2003)
Discussiones Mathematicae Graph Theory
Similarity:
Bondy and Erdős [2] have conjectured that the Ramsey number for three cycles Cₖ of odd length has value r(Cₖ,Cₖ,Cₖ) = 4k-3. We give a proof that r(C₇,C₇,C₇) = 25 without using any computer support.
Olivier Catoni, Raphaël Cerf (2010)
ESAIM: Probability and Statistics
Similarity:
We study the exit path from a general domain after the last visit to a set of a Markov chain with rare transitions. We prove several large deviation principles for the law of the succession of the cycles visited by the process (the cycle path), the succession of the saddle points gone through to jump from cycle to cycle on the cycle path (the saddle path) and the succession of all the points gone through (the exit path). We estimate the time the process spends in each cycle of...
Vu Dinh Hoa (1998)
Discussiones Mathematicae Graph Theory
Similarity:
Hoffman, F., Locke, S.C., Meyerowitz, A.D. (1991)
Mathematica Pannonica
Similarity:
M.M.M. Jaradat (2008)
Discussiones Mathematicae Graph Theory
Similarity:
A construction of minimum cycle bases of the lexicographic product of graphs is presented. Moreover, the length of a longest cycle of a minimal cycle basis is determined.
John L. Simons (2008)
Acta Arithmetica
Similarity:
Ruskey, F., Sawada, Joe (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Smith, Benjamin R., Cavenagh, Nicholas J. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: