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
n11http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n18http://localhost/temp/predkladatel/
n15http://purl.org/net/nknouf/ns/bibtex#
n16http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n22http://linked.opendata.cz/ontology/domain/vavai/
n20http://linked.opendata.cz/resource/domain/vavai/zamer/
n8https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F03%3A00002033%21RIV%2F2004%2FMSM%2F113204%2FN/
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#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n10http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F03%3A00002033%21RIV%2F2004%2FMSM%2F113204%2FN
rdf:type
skos:Concept n22:Vysledek
dcterms:description
It is proved that deciding if a given graph is switchig equivalent to a regular graph is NP-complete. The proof is based on a variant of regular hypergraph bicoloring problem. It is proved that deciding if a given graph is switchig equivalent to a regular graph is NP-complete. The proof is based on a variant of regular hypergraph bicoloring problem.
dcterms:title
Complexity of hypergraph coloring and Seidel's switching Complexity of hypergraph coloring and Seidel's switching
skos:prefLabel
Complexity of hypergraph coloring and Seidel's switching Complexity of hypergraph coloring and Seidel's switching
skos:notation
RIV/00216208:11320/03:00002033!RIV/2004/MSM/113204/N
n3:strany
297;308
n3:aktivita
n13:P n13:Z
n3:aktivity
P(LN00A056), Z(MSM 113200005)
n3:dodaniDat
n10:2004
n3:domaciTvurceVysledku
n4:1123580
n3:druhVysledku
n7:D
n3:duvernostUdaju
n17:S
n3:entitaPredkladatele
n14:predkladatel
n3:idSjednocenehoVysledku
601858
n3:idVysledku
RIV/00216208:11320/03:00002033
n3:jazykVysledku
n9:eng
n3:klicovaSlova
Complexity;hypergraph;coloring;Seidel's;switching
n3:klicoveSlovo
n12:hypergraph n12:Complexity n12:Seidel%27s n12:coloring n12:switching
n3:kontrolniKodProRIV
[4C87E9F106AF]
n3:mistoKonaniAkce
Berlin
n3:mistoVydani
Berlin
n3:nazevZdroje
Graph Theoretic Concepts in Computer Science
n3:obor
n19:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n16:LN00A056
n3:rokUplatneniVysledku
n10:2003
n3:tvurceVysledku
Kratochvíl, Jan
n3:typAkce
n11:WRD
n3:zahajeniAkce
2003-01-01+01:00
n3:zamer
n20:MSM%20113200005
s:numberOfPages
12
n15:hasPublisher
Springer-Verlag
n8:isbn
3-540-20452-0
n18:organizacniJednotka
11320