Enumerative problems inspired by Mayer's theory of cluster integrals.
Leroux, Pierre (2004)
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.
Displaying similar documents to “Combinatorics and cluster expansions.”
Enumerative problems inspired by Mayer's theory of cluster integrals.
A complete grammar for decomposing a family of graphs into 3-connected components.
Chapuy, Guillaume, Fusy, Éric, Kang, Mihyun, Shoilekova, Bilyana (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The number of labeled 2-connected planar graphs.
Bender, Edward A., Gao, Zhicheng, Wormald, Nicholas C. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Conditional resolvability in graphs: a survey.
Saenpholphat, Varaporn, Zhang, Ping (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Connectivity of the lifts of a greedoid.
Tedford, Steven J. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A triple lacunary generating function for Hermite polynomials.
Gessel, Ira M., Jayawant, Pallayi (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Enumeration and asymptotic properties of unlabeled outerplanar graphs.
Bodirsky, Manuel, Fusy, Eric, Kang, Mihyun, Vigerske, Stefan (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A partition of connected graphs.
Wiseman, Gus (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Decomposing infinite 2-connected graphs into 3-connected components.
Richter, R. Bruce (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On degree sequences of graphs with given cyclomatic number.
Schocker, Manfred (2001)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Rainbow Connection In Sparse Graphs
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.