134 search results - page 2 / 27 » A note on generalized chromatic number and generalized girth |
COMBINATORICS
2007
13 years 4 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
DM
2006
13 years 4 months ago
2006
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
EJC
2008
13 years 5 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
HICSS
2007
IEEE
13 years 11 months ago
2007
IEEE
A massive rise in the number and expenditure of pathology ordering by general practitioners (GPs) concerns the government and attracts various studies with the aim to understand a...
JCT
2007
13 years 4 months ago
2007
In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs KGr sssS, “generalized r-uniform Kneser hypergraphs with intersection multi...