1302 search results - page 24 / 261 » On the Strong Chromatic Number |
140
click to vote
JCT
2008
15 years 6 months ago
2008
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...
161
click to vote
DM
2008
15 years 6 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
161
click to vote
SODA
2000
ACM
15 years 7 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 ...
144
click to vote
JCT
2006
15 years 6 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...
168
click to vote
ICIP
2000
IEEE
15 years 10 months ago
2000
IEEE
Gradual transitions represent a challenging problem for temporal segmentation of video. Here we present two new features for detecting these. Recently, Ngo et al. set out a method...