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 “Counting the number of elements in the mutation classes of -quivers.”
Interchangeability of relevant cycles in graphs.
On the identification of vertices using cycles.
Rosendahl, Petri (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the basis of the direct product of paths and wheels.
Al-Rhayyel, A.A. (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity:
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.
On bicritical snarks
Eckhard Steffen (2001)
Mathematica Slovaca
Similarity:
A problem concerning -pancyclic graphs
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity:
Some gregarious cycle decompositions of complete equipartite graphs.
Smith, Benjamin R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable.
Borodin, O.V., Glebov, A.N., Jensen, Tommy R., Raspaud, Andre (2006)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity: