141 search results - page 29 / 29 » cn 2007 |
109
Voted
ENDM
2007
15 years 3 months ago
2007
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...