Displaying similar documents to “Color neighborhood union conditions for long heterochromatic paths in edge-colored graphs.”

Solution of contaminant transport with adsorption in porous media by the method of characteristics

Jozef Kacur, Roger Van Keer (2001)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique


A new approximation scheme is presented for the mathematical model of convection-diffusion and adsorption. The method is based on the relaxation method and the method of characteristics. We prove the convergence of the method and present some numerical experiments in 1D. The results can be applied to the model of contaminant transport in porous media with multi-site, equilibrium and non-equilibrium type of adsorption.

Motion planning in cartesian product graphs

Biswajit Deb, Kalpesh Kapoor (2014)

Discussiones Mathematicae Graph Theory


Let G be an undirected graph with n vertices. Assume that a robot is placed on a vertex and n − 2 obstacles are placed on the other vertices. A vertex on which neither a robot nor an obstacle is placed is said to have a hole. Consider a single player game in which a robot or obstacle can be moved to adjacent vertex if it has a hole. The objective is to take the robot to a fixed destination vertex using minimum number of moves. In general, it is not necessary that the robot will take...