836 search results - page 42 / 168 » Orthogonal Colorings of Graphs |
134
click to vote
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
112
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
124
Voted
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
ENDM
2007
15 years 1 months ago
2007
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
94
Voted
FCT
2005
Springer
15 years 7 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...