Displaying similar documents to “Symmetric Hamilton Cycle Decompositions of Complete Multigraphs”

Time-symmetric cycles.

Bernhardt, Chris (2003)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Decomposition of Complete Multigraphs Into Stars and Cycles

Fairouz Beggas, Mohammed Haddad, Hamamache Kheddouci (2015)

Discussiones Mathematicae Graph Theory

Similarity:

Let k be a positive integer, Sk and Ck denote, respectively, a star and a cycle of k edges. λKn is the usual notation for the complete multigraph on n vertices and in which every edge is taken λ times. In this paper, we investigate necessary and sufficient conditions for the existence of the decomposition of λKn into edges disjoint of stars Sk’s and cycles Ck’s.

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.

Pancyclicity when each Cycle Must Pass Exactly k Hamilton Cycle Chords

Fatima Affif Chaouche, Carrie G. Rutherford, Robin W. Whitty (2015)

Discussiones Mathematicae Graph Theory

Similarity:

It is known that Θ(log n) chords must be added to an n-cycle to produce a pancyclic graph; for vertex pancyclicity, where every vertex belongs to a cycle of every length, Θ(n) chords are required. A possibly ‘intermediate’ variation is the following: given k, 1 ≤ k ≤ n, how many chords must be added to ensure that there exist cycles of every possible length each of which passes exactly k chords? For fixed k, we establish a lower bound of ∩(n1/k) on the growth rate.

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.