Alspach's problem: The case of Hamilton cycles and 5-cycles.
Jordon, Heather (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jordon, Heather (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Smith, Benjamin R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fuchs, Elena D. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Eckhard Steffen (2001)
Mathematica Slovaca
Similarity:
Lawrence Somer, Michal Křížek (2011)
Czechoslovak Mathematical Journal
Similarity:
We assign to each pair of positive integers and a digraph whose set of vertices is and for which there is a directed edge from to if . We investigate the structure of . In particular, upper bounds are given for the longest cycle in . We find subdigraphs of , called fundamental constituents of , for which all trees attached to cycle vertices are isomorphic.
Alexeev, Boris (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Smith, Benjamin R., Cavenagh, Nicholas J. (2010)
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:
Atif A. Abueida, Chester Lian (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Let Cm and Sm denote a cycle and a star on m edges, respectively. We investigate the decomposition of the complete graphs, Kn, into cycles and stars on the same number of edges. We give an algorithm that determines values of n, for a given value of m, where Kn is {Cm, Sm}-decomposable. We show that the obvious necessary condition is sufficient for such decompositions to exist for different values of m.
Frieze, Alan (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity: