This HTML5 document contains 44 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/
n3http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/resource/domain/vavai/projekt/
n20http://linked.opendata.cz/resource/domain/vavai/subjekt/
n8http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n21http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F49777513%3A23520%2F13%3A43919733%21RIV14-GA0-23520___/
skoshttp://www.w3.org/2004/02/skos/core#
n12http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n9http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n18http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F49777513%3A23520%2F13%3A43919733%21RIV14-GA0-23520___
rdf:type
n8:Vysledek skos:Concept
rdfs:seeAlso
http://www.sciencedirect.com/science/article/pii/S0012365X12003676#
dcterms:description
The main result of the paper says that in every 2-connected claw-free graph there is a 2-factor such that the lenght of the longest cycle in it is at least 2d+4, where d is the minimum degree of the graph. This is proved for d at least 7. The main result of the paper says that in every 2-connected claw-free graph there is a 2-factor such that the lenght of the longest cycle in it is at least 2d+4, where d is the minimum degree of the graph. This is proved for d at least 7.
dcterms:title
Circumferences of 2-factors in claw-free graphs Circumferences of 2-factors in claw-free graphs
skos:prefLabel
Circumferences of 2-factors in claw-free graphs Circumferences of 2-factors in claw-free graphs
skos:notation
RIV/49777513:23520/13:43919733!RIV14-GA0-23520___
n8:predkladatel
n20:orjk%3A23520
n5:aktivita
n6:P
n5:aktivity
P(GBP202/12/G061)
n5:cisloPeriodika
19
n5:dodaniDat
n18:2014
n5:domaciTvurceVysledku
n14:5395259
n5:druhVysledku
n10:J
n5:duvernostUdaju
n19:S
n5:entitaPredkladatele
n21:predkladatel
n5:idSjednocenehoVysledku
65508
n5:idVysledku
RIV/49777513:23520/13:43919733
n5:jazykVysledku
n9:eng
n5:klicovaSlova
Minimum degree; 2-factor; Circumference; Hamiltonian; Claw-free graph
n5:klicoveSlovo
n7:Hamiltonian n7:Claw-free%20graph n7:2-factor n7:Minimum%20degree n7:Circumference
n5:kodStatuVydavatele
NL - Nizozemsko
n5:kontrolniKodProRIV
[FC1C1E363DF9]
n5:nazevZdroje
DISCRETE MATHEMATICS
n5:obor
n16:BA
n5:pocetDomacichTvurcuVysledku
1
n5:pocetTvurcuVysledku
2
n5:projekt
n13:GBP202%2F12%2FG061
n5:rokUplatneniVysledku
n18:2013
n5:svazekPeriodika
313
n5:tvurceVysledku
Chiba, Shuya Čada, Roman
n5:wos
000322689800015
s:issn
0012-365X
s:numberOfPages
10
n12:doi
10.1016/j.disc.2012.08.005
n3:organizacniJednotka
23520