The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
Abstract. As shown by Thanh-Hao [11], the solution existence results established by Facchinei and Pang [5, Vol. I, Prop. 2.2.3 and Theorem 2.3.4] for variational inequalities in ge...
Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...
ABSTRACT. We prove the so-called generalized Haff's law yielding the optimal algebraic cooling rate of the temperature of a granular gas described by the homogeneous Boltzmann...
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...