About: Graph colouring with no large monochromatic components     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • 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)
  • 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.
  • 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)
Title
  • Graph colouring with no large monochromatic components
  • Obarvení grafů bez velkých jednobarevných komponent (cs)
  • Graph colouring with no large monochromatic components (en)
skos:prefLabel
  • Graph colouring with no large monochromatic components
  • Obarvení grafů bez velkých jednobarevných komponent (cs)
  • Graph colouring with no large monochromatic components (en)
skos:notation
  • RIV/00216208:11320/08:00100594!RIV09-MSM-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), Z(MSM0021620838)
http://linked.open...iv/cisloPeriodika
  • 4
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
  • 369604
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/08:00100594
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Graph; colouring; large; monochromatic; components (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • GB - Spojené království Velké Británie a Severního Irska
http://linked.open...ontrolniKodProRIV
  • [C5E5115E12FC]
http://linked.open...i/riv/nazevZdroje
  • Combinatorics Probability and Computing
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
  • 17
http://linked.open...iv/tvurceVysledku
  • Matoušek, Jiří
  • Linial, Nathan
  • Sheffet, Or
  • Tardos, Gábor
http://linked.open...ain/vavai/riv/wos
  • 000258173600009
http://linked.open...n/vavai/riv/zamer
issn
  • 0963-5483
number of pages
http://localhost/t...ganizacniJednotka
  • 11320
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 41 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software