1633 search results - page 105 / 327 » Planar Map Graphs |
DM
2006
13 years 10 months ago
2006
A reflexive graph is a simple undirected graph where a loop has been added at each vertex. If G and H are reflexive graphs and U V (H), then a vertex map f : U V (G) is called n...
COMBINATORICS
2004
13 years 10 months ago
2004
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
FOCS
1998
IEEE
14 years 2 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
CPC
2007
13 years 10 months ago
2007
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. G.D. Birkhoff and D.C. Lewis showed that, if G is a plane near triangulation, then the only zeros of...
ALGORITHMICA
2004
13 years 10 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...