{"?xml":{"@version":"1.0"},"edm: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-E1NDPMMF/EA59612A-3FB9-4EFD-9E2E-1DC010B7EF37/PDF","dcterms:extent":"0 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-E1NDPMMF/9a4c6d8b-809d-4690-8d96-3735db3031e0/PDF","dcterms:extent":"250 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-E1NDPMMF/4af2815c-7a7f-4a76-8f63-f01f6fff649b/TEXT","dcterms:extent":"24 KB"}],"edm:TimeSpan":{"@rdf:about":"2008-2025","edm:begin":{"@xml:lang":"en","#text":"2008"},"edm:end":{"@xml:lang":"en","#text":"2025"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-E1NDPMMF","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2012","dc:creator":"Hass, Ruth","dc:format":[{"@xml:lang":"sl","#text":"številka:1"},{"@xml:lang":"sl","#text":"letnik:5"},{"@xml:lang":"sl","#text":"str. 149-157"}],"dc:identifier":["COBISSID:16272985","ISSN:1855-3966","URN:URN:NBN:SI:doc-E1NDPMMF"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Društvo matematikov, fizikov in astronomov Slovenije"},"dc:subject":[{"@xml:lang":"sl","#text":"barvanje grafov"},{"@xml:lang":"en","#text":"canonical coloring"},{"@xml:lang":"en","#text":"graph coloring"},{"@xml:lang":"en","#text":"graph theory"},{"@xml:lang":"sl","#text":"kanonično barvanje"},{"@xml:lang":"sl","#text":"teorija grafov"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"The canonical coloring graph of trees and cycles|"},"dc:description":{"@xml:lang":"sl","#text":"For a graph ?$G$? and an ordering of the vertices ?$\\pi$?, the set of canonical ?$k$?-colorings of ?$G$? under ?$\\pi$? is the set of non-isomorphic proper ?$k$?-colorings of ?$G$? that are lexicographically least under ?$\\pi$?. The canonical coloring graph Can?$_k^\\pi(G)$? is the graph with vertex set the canonical colorings of ?$G$? and two vertices are adjacent if the colorings differ in exactly one place. This is a natural variation of the color graph ?${\\mathcal C}_k(G)$? where all colorings are considered. We show that every graph has a canonical coloring graph which is disconnected; that trees have canonical coloring graphs that are Hamiltonian; and cycles have canonical coloring graphs that are connected"},"edm:type":"TEXT","dc:type":[{"@xml:lang":"sl","#text":"znanstveno časopisje"},{"@xml:lang":"en","#text":"journals"},{"@rdf:resource":"http://www.wikidata.org/entity/Q361785"}]},"ore:Aggregation":{"@rdf:about":"http://www.dlib.si/?URN=URN:NBN:SI:doc-E1NDPMMF","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-E1NDPMMF"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-E1NDPMMF/EA59612A-3FB9-4EFD-9E2E-1DC010B7EF37/PDF"},"edm:rights":{"@rdf:resource":"http://creativecommons.org/licenses/by/4.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:intermediateProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:dataProvider":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:doc-E1NDPMMF/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-E1NDPMMF"}}}}