This HTML5 document contains 40 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/
n4http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F49777513%3A23520%2F10%3A00503513%21RIV11-MSM-23520___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F49777513%3A23520%2F10%3A00503513%21RIV11-MSM-23520___
rdf:type
skos:Concept n17:Vysledek
dcterms:description
Ryjáček introduced a closure concept for claw-free graphs based on local completion of a locally connected vertex. Connected graphs A, for which the class of (C,A)-free graphs is stable under the closure, were completely characterized. In this paper, we introduce a variation of the closure concept based on local completion of a locally connected edge of a claw-free graph. The closure is uniquely determined and preserves the value of the circumference of a graph. We show that the class of (C,A)-free graphs is stable under the edge-closure if A \in {H,Pi,Ni,j,k}. Ryjáček introduced a closure concept for claw-free graphs based on local completion of a locally connected vertex. Connected graphs A, for which the class of (C,A)-free graphs is stable under the closure, were completely characterized. In this paper, we introduce a variation of the closure concept based on local completion of a locally connected edge of a claw-free graph. The closure is uniquely determined and preserves the value of the circumference of a graph. We show that the class of (C,A)-free graphs is stable under the edge-closure if A \in {H,Pi,Ni,j,k}.
dcterms:title
The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs
skos:prefLabel
The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs
skos:notation
RIV/49777513:23520/10:00503513!RIV11-MSM-23520___
n5:aktivita
n6:P
n5:aktivity
P(1M0545)
n5:cisloPeriodika
13-14
n5:dodaniDat
n8:2011
n5:domaciTvurceVysledku
n16:1675737 n16:4528166
n5:druhVysledku
n10:J
n5:duvernostUdaju
n13:S
n5:entitaPredkladatele
n11:predkladatel
n5:idSjednocenehoVysledku
255736
n5:idVysledku
RIV/49777513:23520/10:00503513
n5:jazykVysledku
n18:eng
n5:klicovaSlova
Closure concept; Edge-closure concept; Hamiltonicity; Stable property
n5:klicoveSlovo
n12:Hamiltonicity n12:Stable%20property n12:Closure%20concept n12:Edge-closure%20concept
n5:kodStatuVydavatele
NL - Nizozemsko
n5:kontrolniKodProRIV
[CB95E71C8210]
n5:nazevZdroje
Discrete Mathematics
n5:obor
n15:BA
n5:pocetDomacichTvurcuVysledku
2
n5:pocetTvurcuVysledku
2
n5:projekt
n14:1M0545
n5:rokUplatneniVysledku
n8:2010
n5:svazekPeriodika
310
n5:tvurceVysledku
Holub, Přemysl Brousek, Jan
s:issn
0012-365X
s:numberOfPages
8
n4:organizacniJednotka
23520