Attributes | Values |
---|
rdf:type
| |
Description
| - (This paper is an extended abstract) 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.
- (This paper is an extended abstract) 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)
- (Tento článek je konferenční abstrakt) Pro graf G definujeme mcc(t,G) jako nejmenší číslo m takové, že existuje obarvení vrcholů G pomocí t barev takové, že žádný souvislý jednobarevný podgraf nemá víc než m vrcholů. Pro různé třídy grafů se zkoumá maximum mcc(2,G) přes všechny n=vrcholové grafy z příslušné třídy. Například se dokazuje, že pro rovinné grafy je toto maximum řádu n na 2/3. (cs)
|
Title
| - Graph coloring with no large monochromatic components
- Obarvení grafů bez velkých jednobarevných komponent (cs)
- Graph coloring with no large monochromatic components (en)
|
skos:prefLabel
| - Graph coloring with no large monochromatic components
- Obarvení grafů bez velkých jednobarevných komponent (cs)
- Graph coloring with no large monochromatic components (en)
|
skos:notation
| - RIV/00216208:11320/07:00004333!RIV08-MSM-11320___
|
http://linked.open.../vavai/riv/strany
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(1M0545), Z(MSM0021620838)
|
http://linked.open...iv/cisloPeriodika
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216208:11320/07:00004333
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - Graph; coloring; large; monochromatic; components (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...odStatuVydavatele
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...i/riv/nazevZdroje
| - Electronic Notes in Discrete Mathematics
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...v/svazekPeriodika
| |
http://linked.open...iv/tvurceVysledku
| |
http://linked.open...n/vavai/riv/zamer
| |
issn
| |
number of pages
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |