A problem concerning -pancyclic graphs
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity:
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity:
Lazebnik, Felix, Verstraëte, Jacques (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Eckhard Steffen (2001)
Mathematica Slovaca
Similarity:
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.
Gould, Ronald, Łuczak, Tomasz, Schmitt, John (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vasil Jacoš (1975)
Matematický časopis
Similarity:
Peled, Uri N., Wu, Julin (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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.
Dzido, Tomasz, Kubale, Marek, Piwakowski, Konrad (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: