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/
n8http://localhost/temp/predkladatel/
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n11http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://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#
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F49777513%3A23520%2F13%3A43919958%21RIV15-MSM-23520___/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F49777513%3A23520%2F13%3A43919958%21RIV15-MSM-23520___
rdf:type
skos:Concept n15:Vysledek
dcterms:description
We conjecture that every signed graph of unbalanced girth 2g, whose underlying graph is bipartite and planar, admits a homomorphism to the signed projective cube of dimension 2g-1. Our main result is to show that for a given g, this conjecture is equivalent to the corresponding case (k = 2g) of a conjecture of Seymour claiming that every planar k-regular multigraph with no odd edge-cut of less than k edges is k-edge-colorable. We conjecture that every signed graph of unbalanced girth 2g, whose underlying graph is bipartite and planar, admits a homomorphism to the signed projective cube of dimension 2g-1. Our main result is to show that for a given g, this conjecture is equivalent to the corresponding case (k = 2g) of a conjecture of Seymour claiming that every planar k-regular multigraph with no odd edge-cut of less than k edges is k-edge-colorable.
dcterms:title
Homomorphisms of planar signed graphs to signed projective cubes Homomorphisms of planar signed graphs to signed projective cubes
skos:prefLabel
Homomorphisms of planar signed graphs to signed projective cubes Homomorphisms of planar signed graphs to signed projective cubes
skos:notation
RIV/49777513:23520/13:43919958!RIV15-MSM-23520___
n3:aktivita
n17:P
n3:aktivity
P(EE2.3.30.0013)
n3:cisloPeriodika
3
n3:dodaniDat
n16:2015
n3:domaciTvurceVysledku
n11:8137153
n3:druhVysledku
n5:J
n3:duvernostUdaju
n9:S
n3:entitaPredkladatele
n18:predkladatel
n3:idSjednocenehoVysledku
78002
n3:idVysledku
RIV/49777513:23520/13:43919958
n3:jazykVysledku
n14:eng
n3:klicovaSlova
homomorphism, signed graph, projective cube
n3:klicoveSlovo
n4:homomorphism n4:signed%20graph n4:projective%20cube
n3:kodStatuVydavatele
FR - Francouzská republika
n3:kontrolniKodProRIV
[C87AA371C2A8]
n3:nazevZdroje
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
n3:obor
n10:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:projekt
n12:EE2.3.30.0013
n3:rokUplatneniVysledku
n16:2013
n3:svazekPeriodika
15
n3:tvurceVysledku
Naserasr, Reza Sopena, Eric Rollová, Edita
n3:wos
000327036900001
s:issn
1462-7264
s:numberOfPages
12
n8:organizacniJednotka
23520