-cycle free one-factorizations of complete graphs.

Meszka, Mariusz

Displaying similar documents to “ $k$ -cycle free one-factorizations of complete graphs.”

Alspach's problem: The case of Hamilton cycles and 5-cycles.

Jordon, Heather (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Some gregarious cycle decompositions of complete equipartite graphs.

Smith, Benjamin R. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Longest induced cycles in circulant graphs.

Fuchs, Elena D. (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On bicritical snarks

Eckhard Steffen (2001)

Mathematica Slovaca

Similarity:

The structure of digraphs associated with the congruence $x^{k} \equiv y (mod n)$

Lawrence Somer, Michal Křížek (2011)

Czechoslovak Mathematical Journal

Similarity:

We assign to each pair of positive integers $n$ and $k \geq 2$ a digraph $G (n, k)$ whose set of vertices is $H = {0, 1, \dots, n - 1}$ and for which there is a directed edge from $a \in H$ to $b \in H$ if $a^{k} \equiv b (mod n)$ . We investigate the structure of $G (n, k)$ . In particular, upper bounds are given for the longest cycle in $G (n, k)$ . We find subdigraphs of $G (n, k)$ , called fundamental constituents of $G (n, k)$ , for which all trees attached to cycle vertices are isomorphic.

On lengths of rainbow cycles.

Alexeev, Boris (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Decomposing complete equipartite graphs into short odd cycles.

Smith, Benjamin R., Cavenagh, Nicholas J. (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Interchangeability of relevant cycles in graphs.

Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Displaying similar documents to “ k -cycle free one-factorizations of complete graphs.”

Displaying similar documents to “ $k$ -cycle free one-factorizations of complete graphs.”