34 search results - page 1 / 7 » Total Colorings Of Degenerate Graphs |
47
Voted
COMBINATORICA
2007
14 years 10 months ago
2007
111
click to vote
COLOGNETWENTE
2010
14 years 8 months ago
2010
An interval total t coloring of a graph G is a total coloring of with colors 1, such that at least one vertex or edge of is colored by color − G 2, ,t… G , 1, 2, ,i i t= … ,...
DM
1998
14 years 9 months ago
1998
The total chromatic number zt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same colo...
IPL
2010
14 years 8 months ago
2010
COMBINATORICS
2004
14 years 10 months ago
2004
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...