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 “De Bruijn cycles and their application for encoding of discrete positions”
Interchangeability of relevant cycles in graphs.
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:
Alternating cycles and realizations of a degree sequence
Zofia Majcher (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
On the intersections of longest cycles in a graph.
Stewart, Iain A., Thompson, Ben (1995)
Experimental Mathematics
Similarity:
Exotic Collatz cycles
John L. Simons (2008)
Acta Arithmetica
Similarity:
Alspach's problem: The case of Hamilton cycles and 5-cycles.
Jordon, Heather (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graph invariants and large cycles: a survey.
Nikoghosyan, Zh.G. (2011)
International Journal of Mathematics and Mathematical Sciences
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 a minimum cycle basis of a graph
E. Kolasińska (1980)
Applicationes Mathematicae
Similarity: