This HTML5 document contains 45 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://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F49777513%3A23520%2F03%3A00000223%21RIV%2F2004%2FMSM%2F235204%2FN/
n14http://localhost/temp/predkladatel/
n18http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/ontology/domain/vavai/
n17http://linked.opendata.cz/resource/domain/vavai/zamer/
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#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F49777513%3A23520%2F03%3A00000223%21RIV%2F2004%2FMSM%2F235204%2FN
rdf:type
n9:Vysledek skos:Concept
dcterms:description
A family of cliques in a graph $G$ is said to be p-regular if any two cliques in the family intersect in exactly $p$ vertices. A graph $G$ is said to have a p-regular k-clique cover if there is a $p$-regular family $\cal H$ of k-cliques of $G$ such tha t each edge $G$ belongs to a clique in $\cal H$. Such a p-regular k-clique cover is separable if the complete subgraphs of order $p$ that arise as intersections of pairs of distinct cliques of $\cal H$ are mutually vertex-disjoint. A family of cliques in a graph $G$ is said to be p-regular if any two cliques in the family intersect in exactly $p$ vertices. A graph $G$ is said to have a p-regular k-clique cover if there is a $p$-regular family $\cal H$ of k-cliques of $G$ such tha t each edge $G$ belongs to a clique in $\cal H$. Such a p-regular k-clique cover is separable if the complete subgraphs of order $p$ that arise as intersections of pairs of distinct cliques of $\cal H$ are mutually vertex-disjoint.
dcterms:title
Regular clique covers of graphs Regular clique covers of graphs
skos:prefLabel
Regular clique covers of graphs Regular clique covers of graphs
skos:notation
RIV/49777513:23520/03:00000223!RIV/2004/MSM/235204/N
n3:strany
307-316
n3:aktivita
n12:Z n12:P
n3:aktivity
P(LN00A056), Z(MSM 235200001)
n3:cisloPeriodika
0
n3:dodaniDat
n5:2004
n3:domaciTvurceVysledku
n4:1991493
n3:druhVysledku
n16:J
n3:duvernostUdaju
n10:S
n3:entitaPredkladatele
n19:predkladatel
n3:idSjednocenehoVysledku
625070
n3:idVysledku
RIV/49777513:23520/03:00000223
n3:jazykVysledku
n15:eng
n3:klicovaSlova
clique; clique cover
n3:klicoveSlovo
n13:clique%20cover n13:clique
n3:kodStatuVydavatele
AU - Australské společenství
n3:kontrolniKodProRIV
[1272090230D3]
n3:nazevZdroje
Australasian Journal of Combinatorics
n3:obor
n11:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
5
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n18:LN00A056
n3:rokUplatneniVysledku
n5:2003
n3:svazekPeriodika
Neuveden
n3:tvurceVysledku
Archdeacon, Dan Ryjáček, Zdeněk Jajcay, Robert Fronček, Dalibor Širáň, Jozef
n3:zamer
n17:MSM%20235200001
s:issn
1034-4942
s:numberOfPages
10
n14:organizacniJednotka
23520