117 search results - page 4 / 24 » Graphs with Chromatic Roots in the Interval (1, 2) |
JCT
2006
13 years 7 months ago
2006
Let V be a vector space of dimension v over a field of order q. The q-Kneser graph has the kdimensional subspaces of V as its vertices, where two subspaces and are adjacent if and...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
DAM
2006
13 years 7 months ago
2006
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
COMBINATORICS
2004
13 years 7 months ago
2004
Let (a1, a2,
ISAAC
2005
Springer
14 years 26 days ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...