278 search results - page 38 / 56 » Two Upper Bounds on the Chromatic Number |
101
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
119
click to vote
ICALP
2009
Springer
16 years 2 days ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
ISCAS
2006
IEEE
15 years 5 months ago
2006
IEEE
— The X-architecture is a new integrated-circuit wiring technique in the physical design. Compared with the currently used M-architecture, which uses either horizontal or vertica...
102
click to vote
DM
2008
14 years 12 months ago
2008
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
111
click to vote
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...