Graph compositions. I: Basic enumeration.
Knopfmacher, A., Mays, M.E. (2001)
Integers
Similarity:
Knopfmacher, A., Mays, M.E. (2001)
Integers
Similarity:
Ladislav Nebeský (1984)
Czechoslovak Mathematical Journal
Similarity:
Juraj Bosák (1984)
Mathematica Slovaca
Similarity:
Slobodan Simić, Ivan Gutman, Vladimir Baltić (2000)
Mathematica Slovaca
Similarity:
Pokrovskiy, A. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Carmi, Paz, Dujmovic, Vida, Morin, Pat, Wood, David R. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Arnfried Kemnitz, Jakub Przybyło, Ingo Schiermeyer, Mariusz Woźniak (2013)
Discussiones Mathematicae Graph Theory
Similarity:
An edge-coloured connected graph G = (V,E) is called rainbow-connected if each pair of distinct vertices of G is connected by a path whose edges have distinct colours. The rainbow connection number of G, denoted by rc(G), is the minimum number of colours such that G is rainbow-connected. In this paper we prove that rc(G) ≤ k if |V (G)| = n and for all integers n and k with n − 6 ≤ k ≤ n − 3. We also show that this bound is tight.
Little, C., Vince, A. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: