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

Statements

Subject Item
n2:RIV%2F49777513%3A23520%2F10%3A00503291%21RIV11-GA0-23520___
rdf:type
n7:Vysledek skos:Concept
dcterms:description
The concept of a packing colouring is related to a frequency assignment problem. The packing chromatix number X_p(G) of a graph G is the smallest integer k such that the vertex set V (G) can be partitioned into disjoint classes X_1,..., X_k, where vertices in X_i have pairwise distance greater than i. In this note we improve the upper bound on the packing chromatic number of the square lattice. The concept of a packing colouring is related to a frequency assignment problem. The packing chromatix number X_p(G) of a graph G is the smallest integer k such that the vertex set V (G) can be partitioned into disjoint classes X_1,..., X_k, where vertices in X_i have pairwise distance greater than i. In this note we improve the upper bound on the packing chromatic number of the square lattice.
dcterms:title
A note on packing chromatic number of the square lattics A note on packing chromatic number of the square lattics
skos:prefLabel
A note on packing chromatic number of the square lattics A note on packing chromatic number of the square lattics
skos:notation
RIV/49777513:23520/10:00503291!RIV11-GA0-23520___
n3:aktivita
n18:P
n3:aktivity
P(1M0545), P(GA201/09/0097)
n3:cisloPeriodika
1
n3:dodaniDat
n10:2011
n3:domaciTvurceVysledku
n15:1675737 n15:8321639
n3:druhVysledku
n5:J
n3:duvernostUdaju
n9:S
n3:entitaPredkladatele
n13:predkladatel
n3:idSjednocenehoVysledku
244795
n3:idVysledku
RIV/49777513:23520/10:00503291
n3:jazykVysledku
n14:eng
n3:klicovaSlova
packing chromatic number; packing colouring; square lattice
n3:klicoveSlovo
n6:packing%20colouring n6:square%20lattice n6:packing%20chromatic%20number
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[D5885A6D58C1]
n3:nazevZdroje
Electronic Journal of Combinatorics
n3:obor
n11:BA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n12:GA201%2F09%2F0097 n12:1M0545
n3:rokUplatneniVysledku
n10:2010
n3:svazekPeriodika
17
n3:tvurceVysledku
Holub, Přemysl Soukal, Roman
s:issn
1077-8926
s:numberOfPages
8
n16:organizacniJednotka
23520