3204 search results - page 126 / 641 » The b-chromatic Number of a Graph |
COMBINATORICA
2010
13 years 7 months ago
2010
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
SODA
1990
ACM
13 years 11 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
DM
2010
13 years 10 months ago
2010
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and
IWSOC
2003
IEEE
14 years 3 months ago
2003
IEEE
The availability of high-level design entry tooling is crucial for the viability of any reconfigurable SoC architecture. This paper presents a template generation method to extra...