Decomposing complete equipartite graphs into short odd cycles.
Smith, Benjamin R., Cavenagh, Nicholas J. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Bent Hamilton cycles in -dimensional grid graphs.”
Decomposing complete equipartite graphs into short odd cycles.
On bicritical snarks
Eckhard Steffen (2001)
Mathematica Slovaca
Similarity:
Some gregarious cycle decompositions of complete equipartite graphs.
Smith, Benjamin R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A problem concerning -pancyclic graphs
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity:
On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs.
Frieze, Alan (2000)
The Electronic Journal of Combinatorics [electronic only]
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.
A lower bound for the number of edges in a graph containing no two cycles of the same length.
Lai, Chunhui (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the parallel complexity of the alternating hamiltonian cycle problem
E. Bampis, Y. Manoussakis, I. Milis (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: