<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-LJCTN6IT/160ebfd7-3000-4651-8876-9fccb3fe293e/PDF"><dcterms:extent>360 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-LJCTN6IT/eb2db724-06fc-4d84-85a0-45351ea82f49/TEXT"><dcterms:extent>47 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2008-2025"><edm:begin xml:lang="en">2008</edm:begin><edm:end xml:lang="en">2025</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-LJCTN6IT"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2014</dcterms:issued><dc:creator>Hellmuth, Marc</dc:creator><dc:creator>Leydold, Josef</dc:creator><dc:creator>Stadler, Peter F.</dc:creator><dc:format xml:lang="sl">številka:1</dc:format><dc:format xml:lang="sl">letnik:7</dc:format><dc:format xml:lang="sl">str. 123-140</dc:format><dc:identifier>COBISSID:16795737</dc:identifier><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-LJCTN6IT</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Društvo matematikov, fizikov in astronomov Slovenije</dc:publisher><dcterms:isPartOf xml:lang="sl">Ars mathematica contemporanea</dcterms:isPartOf><dc:subject xml:lang="en">Cartesian product</dc:subject><dc:subject xml:lang="en">convex subgraph</dc:subject><dc:subject xml:lang="en">cycle basis</dc:subject><dc:subject xml:lang="en">isometric subgraph</dc:subject><dc:subject xml:lang="en">partial cubes</dc:subject><dc:subject xml:lang="sl">teorija grafov</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">Convex cycle bases|</dc:title><dc:description xml:lang="sl">Convex cycles play a role e.g. in the context of product graphs. We introduce convex cycle bases and describe a polynomial-time algorithm that recognizes whether a given graph has a convex cycle basis and provides an explicit construction in the positive case. Relations between convex cycles bases and other types of cycles bases are discussed. In particular we show that if ?$G$? has a unique minimal cycle bases, this basis is convex. Furthermore, we characterize a class of graphs with convex cycles bases that includes partial cubes and hence median graphs</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-LJCTN6IT"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-LJCTN6IT" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-LJCTN6IT/160ebfd7-3000-4651-8876-9fccb3fe293e/PDF" /><edm:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-LJCTN6IT/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-LJCTN6IT" /></ore:Aggregation></rdf:RDF>