2 search results - page 1 / 1 » Edge-Colorings of Complete Graphs that Avoid Polychromatic T... |
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...
ALGORITHMICA
2006
13 years 4 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...