The List-Chromatic Number of Infinite Graphs Defined on Euclidean Spaces

Abstract  If D is a countable set of positive reals, 2≤n<ω, let X

_n
(D) be the graph with the points of R

ⁿ
as vertices where two vertices are joined iff their distance is in D. We determine the list-chromatic number of X

_n
(D) as much as possible.

• Content Type Journal Article
• DOI 10.1007/s00454-009-9228-5
• Authors
  
  
  • Péter Komjáth, Eötvös University Department of Computer Science P.O. Box 120 Budapest 1518 Hungary
  
  

• Journal Discrete and Computational Geometry
• Online ISSN 1432-0444
• Print ISSN 0179-5376

Published by

Original source : http://www.springerlink.com/content/f44822267r2087...

On the approximation and efficient evaluation of integral terms in PDE models of cell adhesion

Recently, a nonlocal term has been introduced in time-dependent partial differential equation (PDE) models of cell migration in tissue. This term is used to model adhesive effects between cells and also between cells and the extracellular matrix. We assume periodic boundary conditions for the model and that the PDE system is discretized following the method of lines and using a finite-volume scheme on a uniform grid in space. For high-resolution simulations of the PDE system an efficient evaluation of the approximation of the nonlocal term is crucial. For one and two spatial dimensions we develop suitable approximations of the nonlocal term and evaluate these using fast Fourier transform (FFT) techniques. Comprehensive numerical tests show the accuracy and efficiency of our approach. We also demonstrate the impact of the proposed scheme for the treatment of the nonlocal term on simulation times for a differential cell adhesion model. We discuss extensions and applicability of our work to systems with nonperiodic boundary conditions and for other nonlocal PDE models from mathematical biology.

Published by

Original source : http://imajna.oxfordjournals.org/cgi/content/short...