1749 search results - page 31 / 350 » Conditional colorings of graphs |
SODA
2000
ACM
13 years 9 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
JGT
2006
13 years 8 months ago
2006
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...
ICIP
1998
IEEE
14 years 10 months ago
1998
IEEE
ct A color correction matrix is usually used to transform the raw color image obtained from color image sensors to adjust for factors such as variations in illumination and deviati...
COMBINATORICS
2006
13 years 8 months ago
2006
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that -----(u)(v) is an arc in H whenever...
COMBINATORICS
2000
13 years 8 months ago
2000
A counterexample is presented to Gy. Elekes's conjecture concerning the existence of long 2-colored paths in properly colored graphs. A modified version of the conjecture is ...