Graph compositions. I: Basic enumeration.
Knopfmacher, A., Mays, M.E. (2001)
Integers
Similarity:
Displaying similar documents to “Cyclic sieving phenomenon in non-crossing connected graphs.”
Graph compositions. I: Basic enumeration.
Edge-disjoint 1-factors in powers of connected graphs
Ladislav Nebeský (1984)
Czechoslovak Mathematical Journal
Similarity:
Uniquely edge colourable graphs
Juraj Bosák (1984)
Mathematica Slovaca
Similarity:
Some graphs with extremal Szeged index
Slobodan Simić, Ivan Gutman, Vladimir Baltić (2000)
Mathematica Slovaca
Similarity:
Growth of graph powers.
Pokrovskiy, A. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Distinct distances in graph drawings.
Carmi, Paz, Dujmovic, Vida, Morin, Pat, Wood, David R. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: