<?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-50AXQ2RQ/1c8ad28a-ebae-4604-b583-76ce98ddcdbd/PDF"><dcterms:extent>280 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-50AXQ2RQ/0b6dca59-e4cb-4568-8653-770627bb53c1/TEXT"><dcterms:extent>23 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-50AXQ2RQ"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2014</dcterms:issued><dc:creator>Trinks, Martin</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. 141-151</dc:format><dc:identifier>COBISSID:16795993</dc:identifier><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-50AXQ2RQ</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">edge subsets</dc:subject><dc:subject xml:lang="en">spanning forests</dc:subject><dc:subject xml:lang="sl">teorija grafov</dc:subject><dc:subject xml:lang="en">Tutte polynomial</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">From spanning forests to edge subsets|</dc:title><dc:description xml:lang="sl">We give some insight into Tutte's definition of internally and externally active edges for spanning forests. Namely we prove, that every edge subset can be constructed from the edges of exactly one spanning forest by deleting a unique subset of the internally active edges and adding a unique subset of the externally active edges</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-50AXQ2RQ"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-50AXQ2RQ" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-50AXQ2RQ/1c8ad28a-ebae-4604-b583-76ce98ddcdbd/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-50AXQ2RQ/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-50AXQ2RQ" /></ore:Aggregation></rdf:RDF>