6 search results - page 1 / 2 » On Some Chromatic Properties Of Jahangir Graph |
ARSCOM
2007
14 years 9 months ago
2007
CCCG
2010
14 years 11 months ago
2010
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...
101
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
COMBINATORICS
2007
14 years 9 months ago
2007
We introduce and develop a two-parameter chromatic symmetric function for a simple graph G over the field of rational functions in q and t , Q (q, t). We derive its expansion in ...
86
Voted
WG
2005
Springer
15 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 ...