1749 search results - page 1 / 350 » Conditional colorings of graphs |
COMBINATORICS
2007
13 years 4 months ago
2007
DM
2006
13 years 4 months ago
2006
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
ARSCOM
1999
13 years 4 months ago
1999
Alon and Yuster [4] have proven that if a fixed graph K on g vertices is (h + 1)-colorable, then any graph G with n vertices and minimum degree at least h h+1 n contains at least ...
SIAMDM
2008
13 years 4 months ago
2008
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than thes...
ENDM
2000
13 years 4 months ago
2000
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...