This HTML5 document contains 50 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n11http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/projekt/
n15http://linked.opendata.cz/ontology/domain/vavai/
n5http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F08%3A00100513%21RIV09-MSM-11320___/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F08%3A00100513%21RIV09-MSM-11320___
rdf:type
skos:Concept n15:Vysledek
dcterms:description
We settle a problem suggested by Hasegawa and Saito about the relation between the maximum (or minimum) degree of a graph and the size of its boundary. We settle a problem suggested by Hasegawa and Saito about the relation between the maximum (or minimum) degree of a graph and the size of its boundary. Řešíme problém od Hasegawy a Saito, o vztahu mezi maximálním (nebo minimálním) stupněm v grafu a velikostí jeho hranice.
dcterms:title
Lower bounding the boundary of a graph in terms of its maximum or minimum degree Dolní odhad na hranici grafu pomocí maximálního nebo minimálního stupně Lower bounding the boundary of a graph in terms of its maximum or minimum degree
skos:prefLabel
Dolní odhad na hranici grafu pomocí maximálního nebo minimálního stupně Lower bounding the boundary of a graph in terms of its maximum or minimum degree Lower bounding the boundary of a graph in terms of its maximum or minimum degree
skos:notation
RIV/00216208:11320/08:00100513!RIV09-MSM-11320___
n4:aktivita
n10:Z n10:P
n4:aktivity
P(1M0545), Z(MSM0021620838)
n4:cisloPeriodika
24
n4:dodaniDat
n8:2009
n4:domaciTvurceVysledku
Sereni, Jean-Sébastien
n4:druhVysledku
n14:J
n4:duvernostUdaju
n12:S
n4:entitaPredkladatele
n18:predkladatel
n4:idSjednocenehoVysledku
377237
n4:idVysledku
RIV/00216208:11320/08:00100513
n4:jazykVysledku
n17:eng
n4:klicovaSlova
Lower; bounding; boundary; graph; terms; maximum; minimum; degree
n4:klicoveSlovo
n9:terms n9:boundary n9:bounding n9:degree n9:maximum n9:minimum n9:graph n9:Lower
n4:kodStatuVydavatele
NL - Nizozemsko
n4:kontrolniKodProRIV
[1BCF7D5372F1]
n4:nazevZdroje
Discrete Mathematics
n4:obor
n13:BA
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
3
n4:projekt
n16:1M0545
n4:rokUplatneniVysledku
n8:2008
n4:svazekPeriodika
308
n4:tvurceVysledku
Müller, Tobias Sereni, Jean-Sébastien Pór, Attila
n4:wos
000261259100067
n4:zamer
n5:MSM0021620838
s:issn
0012-365X
s:numberOfPages
3
n11:organizacniJednotka
11320