3204 search results - page 117 / 641 » The b-chromatic Number of a Graph |
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
JCT
2008
13 years 10 months ago
2008
We exhibit a a counterexample to a conjecture of Thomassen stating that the number of distinct 3-colorings of every graph whose 3color matrix has full column rank is superpolynomi...
EON
2007
13 years 11 months ago
2007
We describe an approach to create a synthetic workload for large scale extensional query answering experiments. The workload comprises multiple interrelated domain ontologies, data...
DM
2008
13 years 10 months ago
2008
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
JCT
2006
13 years 10 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...