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:
E. Kolasińska (1980)
Applicationes Mathematicae
Similarity:
John L. Simons (2008)
Acta Arithmetica
Similarity:
Al-Rhayyel, A.A. (1996)
International Journal of Mathematics and Mathematical Sciences
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.
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.
Jordon, Heather (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edward G. Belaga (2003)
Acta Arithmetica
Similarity:
John L. Simons (2008)
Acta Arithmetica
Similarity:
B. Kaufmann (1939)
Compositio Mathematica
Similarity:
Leydold, Josef, Stadler, Peter F. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Stewart, Iain A., Thompson, Ben (1995)
Experimental Mathematics
Similarity:
Vismara, Philippe (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
W. Puckett (1938)
Fundamenta Mathematicae
Similarity:
J. Węgrzyn (1971)
Applicationes Mathematicae
Similarity: