Chen et al. (1998) proved that every 18-tough chordal graph has a Hamilton cycle. Improving upon their bound, we show that every 10-tough chordal graph is Hamiltonian (in fact, Hamilton-connected). We use Aharoni and Haxell’s hypergraph extension of Hall’s Theorem as our main tool.

Given a reaction-diffusion system which exhibits Turing's diffusion-driven instability, the influence of unilateral obstacles of opposite sign (source and sink) on bifurcation and critical points is studied. In particular, in some cases it is shown that spatially nonhomogeneous stationary solution...

The aim of this paper is to find explicit formulae for the number of rooted hypermaps with a given number of darts on an orientable surfaces of genus at most three.

The present work strives to answer the questions about the impact of diastema of different width and shape on the evaluation of smile attractiveness, and whether there are differences related to age and gender of evaluators, and differences between lay public and experts, and ...