4913 search results - page 127 / 983 » Results and Perspectives of the G |
WG
2005
Springer
14 years 3 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
DM
2008
13 years 10 months ago
2008
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
APAL
2006
13 years 10 months ago
2006
Abstract. The main result is that for every recursively enumerable existential consistent theory (in the usual language of group theory), there exists a finitely presented SQ-univ...
COMBINATORICA
2007
13 years 10 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
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...