. "For a graph G, we define mcc(t,G) as the smallest m such that there is a coloring of V(G) by t colors so that no monochromatic connected subgraph of G has more than m vertices. For various graph classes we investitgate the maximum of mcc(2,G) over all n-vertex graphs in the class. In particular, for the class of all planar graphs this maximum is of order n to 2/3." . "Graph colouring with no large monochromatic components" . "369604" . . "13"^^ . "RIV/00216208:11320/08:00100594!RIV09-MSM-11320___" . . . . . "Sheffet, Or" . . "4" . "Obarven\u00ED graf\u016F bez velk\u00FDch jednobarevn\u00FDch komponent"@cs . "Graph colouring with no large monochromatic components"@en . "Matou\u0161ek, Ji\u0159\u00ED" . "Obarven\u00ED graf\u016F bez velk\u00FDch jednobarevn\u00FDch komponent"@cs . . "17" . . "Combinatorics Probability and Computing" . . . "[C5E5115E12FC]" . . "Graph colouring with no large monochromatic components" . "Tardos, G\u00E1bor" . "P(1M0545), Z(MSM0021620838)" . "0963-5483" . . "Graph; colouring; large; monochromatic; components"@en . "000258173600009" . . "Pro graf G definujeme mcc(t,G) jako nejmen\u0161\u00ED \u010D\u00EDslo m takov\u00E9, \u017Ee existuje obarven\u00ED vrchol\u016F G pomoc\u00ED t barev takov\u00E9, \u017Ee \u017E\u00E1dn\u00FD souvisl\u00FD jednobarevn\u00FD podgraf nem\u00E1 v\u00EDc ne\u017E m vrchol\u016F. Pro r\u016Fzn\u00E9 t\u0159\u00EDdy graf\u016F se zkoum\u00E1 maximum mcc(2,G) p\u0159es v\u0161echny n=vrcholov\u00E9 grafy z p\u0159\u00EDslu\u0161n\u00E9 t\u0159\u00EDdy. Nap\u0159\u00EDklad se dokazuje, \u017Ee pro rovinn\u00E9 grafy je toto maximum \u0159\u00E1du n na 2/3."@cs . . "Graph colouring with no large monochromatic components"@en . "GB - Spojen\u00E9 kr\u00E1lovstv\u00ED Velk\u00E9 Brit\u00E1nie a Severn\u00EDho Irska" . "1"^^ . "4"^^ . . "Linial, Nathan" . . "11320" . . . "RIV/00216208:11320/08:00100594" . "For a graph G, we define mcc(t,G) as the smallest m such that there is a coloring of V(G) by t colors so that no monochromatic connected subgraph of G has more than m vertices. For various graph classes we investitgate the maximum of mcc(2,G) over all n-vertex graphs in the class. In particular, for the class of all planar graphs this maximum is of order n to 2/3."@en .