3204 search results - page 313 / 641 » The b-chromatic Number of a Graph |
161
click to vote
JGT
2010
15 years 5 months ago
2010
: Let G be a toroidal graph without cycles of a fixed length k, and l(G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant...
139
click to vote
DIAGRAMS
2004
Springer
16 years 5 days ago
2004
Springer
People sometimes appear to build analogical representations in order to reason about graphical information. In this paper we consider the extent to which the tendency to represent ...
227
click to vote
ISPAN
2002
IEEE
15 years 11 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
179
click to vote
ISMB
2000
15 years 8 months ago
2000
A novel description of protein structure in terms of the generalized secondary structure elements (GSSE) is proposed. GSSE's are defined as fragments of the protein structure...
174
click to vote
APPML
2005
15 years 6 months ago
2005
In the previous studies on k-edge fault tolerance with respect to hypercubes Qn, matrices for generating linear k-EFT(Qn) graphs were used. Let EFTL(n, k) denote the set of matric...