751 search results - page 36 / 151 » The Distinguishing Chromatic Number |
153
click to vote
ASE
2010
15 years 6 months ago
2010
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
136
click to vote
DM
1998
15 years 5 months ago
1998
One class of Davenport-Schinzel sequences consists of finite sequences over n symbols without immediate repetitions and without any subsequence of the type abab. We present a bij...
151
click to vote
DM
2006
15 years 6 months ago
2006
Let n(G) denote the number of vertices of a graph G and let (G) be the independence number of G, the maximum number of pairwise nonadjacent vertices of G. The Hall ratio of a grap...
143
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
170
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...