SIAMDM
2008
13 years 11 months ago
2008
SIAMDM
2008
13 years 11 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
SIAMDM
2008
13 years 11 months ago
2008
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
SIAMDM
2008
13 years 11 months ago
2008
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
SIAMDM
2008
13 years 11 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
SIAMDM
2008
13 years 11 months ago
2008
SIAMDM
2008
13 years 11 months ago
2008
Alon, Krech, and Szab
SIAMDM
2008
13 years 11 months ago
2008
We show that every triangle-free graph on the double torus is 4-colorable. This settles a problem raised by Gimbel and Thomassen [Trans. Amer. Math. Soc. 349 (1997), 4555
SIAMDM
2008
13 years 11 months ago
2008
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
SIAMDM
2008
13 years 11 months ago
2008
We prove a conjecture of Erdos, Purdy, and Straus on the number of distinct areas of triangles determined by a set of n points in the plane. We show that if P is a set of n points...