About: Rainbow connection and cycles in graphs     Goto   Sponge   NotDistinct   Permalink

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

AttributesValues
rdf:type
rdfs:seeAlso
Description
  • In the project, we will consider two important problems in the field of Graph Theory: (i) rainbow colouring of graphs, especially computation of (or at least bounds for) the rainbow connection number rc(G) of a given graph G – the problem has an interesting application for the secure transfer of classified information between agencies in communication networks; (ii) computation of (or at least bounds for the size of) a largest subgraph with prescribed properties – cycle, path, trestle (a spanning 2-connected subgraph of bounded degree) etc. – knowledge about such subgraphs has major importance on the structure of a given graph and its other graph properties. (en)
  • V projektu se budeme zabývat dvěma důležitými problémy teorie grafů: (i) duhové barvení grafů, zejména určení (či odhady) duhového čísla souvislosti rc(G) daného grafu G – problém má aplikace pro bezpečný přenos informací mezi agenturami v komunikačních sítích; (ii) nalezení (či odhady velikosti) největšího podgrafu daných vlastností – kružnice, cesty, trestle (2-souvislého faktoru s omezeným maximálním stupněm) atd. v daném (konečném) grafu – znalost těchto podgrafů má významnou roli pro strukturu daného grafu a jeho další grafové vlastnosti.
Title
  • Rainbow connection and cycles in graphs (en)
  • Duhová souvislost a cykly v grafech
skos:notation
  • 7AMB13DE003
http://linked.open...avai/cep/aktivita
http://linked.open...kovaStatniPodpora
http://linked.open...ep/celkoveNaklady
http://linked.open...datumDodatniDoRIV
http://linked.open...i/cep/druhSouteze
http://linked.open...ep/duvernostUdaju
http://linked.open.../cep/fazeProjektu
http://linked.open...ai/cep/hlavniObor
http://linked.open...vai/cep/kategorie
http://linked.open.../cep/klicovaSlova
  • edge colouring, rainbow connection, longest cycle, hamiltonicity, trestle (en)
http://linked.open...ep/partnetrHlavni
http://linked.open...inujicichPrijemcu
http://linked.open...cep/pocetPrijemcu
http://linked.open...ocetSpoluPrijemcu
http://linked.open.../pocetVysledkuRIV
http://linked.open...enychVysledkuVRIV
http://linked.open...lneniVMinulemRoce
http://linked.open.../prideleniPodpory
http://linked.open...iciPoslednihoRoku
http://linked.open...atUdajeProjZameru
http://linked.open...usZobrazovaneFaze
http://linked.open...ai/cep/typPojektu
http://linked.open...ep/ukonceniReseni
http://linked.open...ep/zahajeniReseni
http://linked.open...tniCyklusProjektu
http://linked.open...n/vavai/cep/vyzva
http://linked.open.../cep/klicoveSlovo
  • hamiltonicity
  • longest cycle
  • rainbow connection
  • edge colouring
is http://linked.open...vavai/cep/projekt 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, 18 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software