A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
Kree Cole-McLaughlin, Herbert Edelsbrunner, John H...
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...