3204 search results - page 251 / 641 » The b-chromatic Number of a Graph |
93
Voted
DAM
2008
15 years 24 days ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
106
click to vote
DM
2008
15 years 24 days ago
2008
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
103
click to vote
JCO
2007
15 years 19 days ago
2007
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...
104
Voted
BCB
2010
2010
Fast graph approaches to measure influenza transmission across geographically distributed host types
14 years 7 months ago
Recent advances in next generation sequencing are providing a number of large whole-genome sequence datasets stemming from globally distributed disease occurrences. This offers an...
246
click to vote
ECCC
2011
14 years 7 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...