1749 search results - page 35 / 350 » Conditional colorings of graphs |
PODC
2006
ACM
14 years 2 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
IMAGING
2001
13 years 10 months ago
2001
The world of color image difference modeling can be considered relatively young, when compared with the rich history of general color difference equations. While young, this area ...
COMBINATORICS
2006
13 years 8 months ago
2006
A simple, undirected 2-connected graph G of order n belongs to class O(n,), 0, if 2 = n - . It is well known (Ore's theorem) that G is hamiltonian if = 0, in which case the 2...
TAMC
2010
Springer
14 years 1 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
ESA
2006
Springer
14 years 5 days ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...