On lengths of rainbow cycles.

Alexeev, Boris

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “On lengths of rainbow cycles.”

A Note on a Broken-Cycle Theorem for Hypergraphs

Martin Trinks (2014)

Discussiones Mathematicae Graph Theory

Similarity:

Whitney’s Broken-cycle Theorem states the chromatic polynomial of a graph as a sum over special edge subsets. We give a definition of cycles in hypergraphs that preserves the statement of the theorem there

Interchangeability of relevant cycles in graphs.

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

The Electronic Journal of Combinatorics [electronic only]

Similarity:

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

Jordon, Heather (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Chromatic numbers of the strong product of odd cycles

Janez Žerovnik (2006)

Mathematica Slovaca

Similarity:

Exotic Collatz cycles

John L. Simons (2008)

Acta Arithmetica

Similarity:

Some gregarious cycle decompositions of complete equipartite graphs.

Smith, Benjamin R. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the basis of the direct product of paths and wheels.

Al-Rhayyel, A.A. (1996)

International Journal of Mathematics and Mathematical Sciences

Similarity:

The Grötzsch theorem for the hypergraph of maximal cliques.

Mohar, Bojan, Škrekovski, Riste (1999)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Disjoint 5-cycles in a graph

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.