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.
Displaying similar documents to “Pancyclicity when each Cycle Must Pass Exactly k Hamilton Cycle Chords”
Disjoint 5-cycles in a graph
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.
Graph invariants and large cycles: a survey.
Nikoghosyan, Zh.G. (2011)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A problem concerning -pancyclic graphs
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity:
On some problem related to fundamental cycle sets of a graph: Research notes
Maciej Sysło (1982)
Banach Center Publications
Similarity:
On a minimum cycle basis of a graph
E. Kolasińska (1980)
Applicationes Mathematicae
Similarity:
On the intersections of longest cycles in a graph.
Stewart, Iain A., Thompson, Ben (1995)
Experimental Mathematics
Similarity:
On bicritical snarks
Eckhard Steffen (2001)
Mathematica Slovaca
Similarity:
On long cycles through four prescribed vertices of a polyhedral graph
Jochen Harant, Stanislav Jendrol', Hansjoachim Walther (2008)
Discussiones Mathematicae Graph Theory
Similarity:
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length at least (1/36)c+(20/3) through any four vertices of G.