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 note on graphs without short even cycles.”
Decomposing complete equipartite graphs into short odd cycles.
On the number of cycles in -connected graphs.
Knor, M. (1994)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
A note on the circumference of graphs.
Stacho, L. (1995)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Criticality concepts in geodetic graphs
Pavol Híc (1986)
Mathematica Slovaca
Similarity:
On -Pancyclic Graphs
Vasil Jacoš (1975)
Matematický časopis
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 hypergraphs of girth five.
Lazebnik, Felix, Verstraëte, Jacques (2003)
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: