Decomposing complete equipartite graphs into short odd cycles.
Smith, Benjamin R., Cavenagh, Nicholas J. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A Gessel--Viennot-type method for cycle systems in a directed graph.”
Decomposing complete equipartite graphs into short odd cycles.
On the number of cycles in a graph
Frank Harary, Bennet Manvel (1971)
Matematický časopis
Similarity:
On -Pancyclic Graphs
Vasil Jacoš (1975)
Matematický časopis
Similarity:
Bent Hamilton cycles in -dimensional grid graphs.
Ruskey, F., Sawada, Joe (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the identification of vertices using cycles.
Rosendahl, Petri (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Reconstructing permutations from cycle minors.
Monks, Maria (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a conjecture concerning the Petersen graph.
Nelson, Donald, Plummer, Michael D., Robertson, Neil, Zha, Xiaoya (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on graphs without short even cycles.
Lam, Thomas, Verstraëte, Jacques (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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 number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs.
Frieze, Alan (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity: