Interchangeability of relevant cycles in graphs.
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
John L. Simons (2008)
Acta Arithmetica
Similarity:
Devra Garfinkle (1992)
Compositio Mathematica
Similarity:
Olivier Catoni, Raphaël Cerf (1997)
ESAIM: Probability and Statistics
Similarity:
Leydold, Josef, Stadler, Peter F. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
B. Kaufmann (1939)
Compositio Mathematica
Similarity:
Karol Borsuk (1952)
Fundamenta Mathematicae
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.
Al-Rhayyel, A.A. (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity:
E. Kolasińska (1980)
Applicationes Mathematicae
Similarity:
Walden, Byron L. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Edward G. Belaga (2003)
Acta Arithmetica
Similarity: