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 search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Interchangeability of relevant cycles in graphs.”
On the basis of the direct product of paths and wheels.
Exotic Collatz cycles
John L. Simons (2008)
Acta Arithmetica
Similarity:
On a minimum cycle basis of a graph
E. Kolasińska (1980)
Applicationes Mathematicae
Similarity:
Minimal cycle bases of outerplanar graphs.
Leydold, Josef, Stadler, Peter F. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Minimal cycle bases of the lexicographic product of graphs
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.
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.
Searching for Kaprekar's constants: algorithms and results.
Walden, Byron L. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Alspach's problem: The case of Hamilton cycles and 5-cycles.
Jordon, Heather (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edge cycle extendable graphs
Terry A. McKee (2012)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is edge cycle extendable if every cycle C that is formed from edges and one chord of a larger cycle C⁺ is also formed from edges and one chord of a cycle C' of length one greater than C with V(C') ⊆ V(C⁺). Edge cycle extendable graphs are characterized by every block being either chordal (every nontriangular cycle has a chord) or chordless (no nontriangular cycle has a chord); equivalently, every chord of a cycle of length five or more has a noncrossing chord.
On the intersections of longest cycles in a graph.
Stewart, Iain A., Thompson, Ben (1995)
Experimental Mathematics
Similarity:
Theoretical and computational bounds for m-cycles of the 3n+1-problem
John Simons, Benne de Weger (2005)
Acta Arithmetica
Similarity:
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
Differential equations with infinite number of limit cycles
J. Węgrzyn (1971)
Applicationes Mathematicae
Similarity:
On lengths of rainbow cycles.
Alexeev, Boris (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Effective polynomial upper bounds to perigees and numbers of (3x+d)-cycles of a given oddlength
Edward G. Belaga (2003)
Acta Arithmetica
Similarity: