3 search results - page 1 / 1 » Cover-Decomposition and Polychromatic Numbers |
ESA
2011
Springer
12 years 4 months ago
2011
Springer
ENDM
2002
13 years 4 months ago
2002
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
DM
2010
13 years 5 months ago
2010
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors o...