Solution to a combinatorial puzzle arising from Mayer's theory of cluster integrals.

Bernardi, Olivier

Displaying similar documents to “Solution to a combinatorial puzzle arising from Mayer's theory of cluster integrals.”

On graphs whose reduced energy does not exceed 3.

Lazić, Mirjana (2005)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

Path partitions of planar graphs.

Glebov, A.N., Zambalaeva, D.Zh. (2007)

Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]

Similarity:

Computing the domination number of grid graphs.

Alanko, Samu, Crevals, Simon, Isopoussu, Anton, Östergård, Patric, Pettersson, Ville (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Antichains in the homomorphism order of graphs

Dwight Duffus, Peter, L. Erdös, Jaroslav Nešetřil, Lajos Soukup (2007)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let $𝔾$ and $𝔻$ , respectively, denote the partially ordered sets of homomorphism classes of finite undirected and directed graphs, respectively, both ordered by the homomorphism relation. Order theoretic properties of both have been studied extensively, and have interesting connections to familiar graph properties and parameters. In particular, the notion of a duality is closely related to the idea of splitting a maximal antichain. We construct both splitting and non-splitting infinite maximal...