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

Statements

Subject Item
n2:RIV%2F49777513%3A23520%2F11%3A43898667%21RIV12-GA0-23520___
rdf:type
n6:Vysledek skos:Concept
dcterms:description
Let L(G) be the set of lengths of odd cycles in a graph G. It is known that if the size of L(G) is k, then G is 2k+1-colorable unless one of its blocks is the complete graph of size 2k+2. In this paper, we improve this bound for graphs G with L(G)={5,7} by showing that they are 3-colorable. Let L(G) be the set of lengths of odd cycles in a graph G. It is known that if the size of L(G) is k, then G is 2k+1-colorable unless one of its blocks is the complete graph of size 2k+2. In this paper, we improve this bound for graphs G with L(G)={5,7} by showing that they are 3-colorable.
dcterms:title
Graphs with odd cycle lengths 5 and 7 are 3-colorable Graphs with odd cycle lengths 5 and 7 are 3-colorable
skos:prefLabel
Graphs with odd cycle lengths 5 and 7 are 3-colorable Graphs with odd cycle lengths 5 and 7 are 3-colorable
skos:notation
RIV/49777513:23520/11:43898667!RIV12-GA0-23520___
n6:predkladatel
n16:orjk%3A23520
n4:aktivita
n12:Z n12:P
n4:aktivity
P(GA201/09/0197), Z(MSM4977751301)
n4:cisloPeriodika
3
n4:dodaniDat
n10:2012
n4:domaciTvurceVysledku
n5:8085188 n5:1244043
n4:druhVysledku
n15:J
n4:duvernostUdaju
n9:S
n4:entitaPredkladatele
n20:predkladatel
n4:idSjednocenehoVysledku
201520
n4:idVysledku
RIV/49777513:23520/11:43898667
n4:jazykVysledku
n14:eng
n4:klicovaSlova
4-critical; odd cycle; 3-colorability; coloring; graph
n4:klicoveSlovo
n11:odd%20cycle n11:coloring n11:graph n11:3-colorability n11:4-critical
n4:kodStatuVydavatele
US - Spojené státy americké
n4:kontrolniKodProRIV
[B6A213508879]
n4:nazevZdroje
SIAM Journal on Discrete Mathematics
n4:obor
n21:BA
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
3
n4:projekt
n17:GA201%2F09%2F0197
n4:rokUplatneniVysledku
n10:2011
n4:svazekPeriodika
25
n4:tvurceVysledku
Rucký, Ondřej Kaiser, Tomáš Škrekovski, Riste
n4:zamer
n13:MSM4977751301
s:issn
0895-4801
s:numberOfPages
20
n8:doi
10.1137/090761860
n19:organizacniJednotka
23520