3204 search results - page 285 / 641 » The Alcuin Number of a Graph |
167
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of fini...
205
click to vote
AGTIVE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Since the systematic evolution of graph-like program models has become important in software engineering, graph transformation has gained much attention in this area. For...
166
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
182
click to vote
CMSB
2006
Springer
15 years 10 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
180
click to vote
CATS
2006
15 years 8 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...