3471 search results - page 274 / 695 » Obstacle Numbers of Graphs |
172
click to vote
COCOA
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
207
click to vote
PPOPP
2006
ACM
16 years 19 days ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
171
click to vote
EJC
2008
15 years 6 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
156
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
Some improved bounds on the number of directions not determined by a point set in the affine space AG(k, q) are presented. More precisely, if there are more than pe (q -1) directio...
196
click to vote
AGTIVE
2007
Springer
16 years 26 days ago
2007
Springer
In this paper we describe the Ludo case, one of the case studies of the AGTIVE 2007 Tool Contest (see [22]). After summarising the case description, we give an overview of the subm...