836 search results - page 106 / 168 » Orthogonal Colorings of Graphs |
129
click to vote
MLQ
1998
15 years 1 months ago
1998
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theor...
116
click to vote
JCO
2010
15 years 10 days ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
101
click to vote
RSA
2000
15 years 1 months ago
2000
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...
106
click to vote
EJC
2010
15 years 2 months ago
2010
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
119
click to vote
SOFSEM
2007
Springer
15 years 8 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...