88 search results - page 4 / 18 » Graph Coloring and the Immersion Order |
160
click to vote
IPL
2008
15 years 4 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) is an arc in H whenever xy is an arc in G. The or...
138
Voted
IPL
2000
15 years 3 months ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
137
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required s...
153
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
147
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...