87 search results - page 3 / 18 » Sum Coloring of Bipartite Graphs with Bounded Degree |
FOCS
2002
IEEE
13 years 11 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
ICALP
2011
Springer
12 years 9 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
JGT
2006
13 years 6 months ago
2006
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
DM
2010
13 years 6 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
DAM
2010
13 years 6 months ago
2010
A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number...