<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/CINECAstyle.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-21T12:49:22Z</responseDate><request verb="GetRecord" identifier="oai:iris.unitn.it:11572/406620" metadataPrefix="oai_dc">https://iris.unitn.it/oai/request</request><GetRecord><record><header><identifier>oai:iris.unitn.it:11572/406620</identifier><datestamp>2024-04-30T02:56:34Z</datestamp><setSpec>com_11572_237821</setSpec><setSpec>com_11572_101871</setSpec><setSpec>col_11572_237822</setSpec><setSpec>ou_ou00004</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title>Edge-colorings and flows in Class 2 graphs</dc:title>
<dc:creator>Tabarelli, Gloria</dc:creator>
<dc:contributor>Tabarelli, Gloria</dc:contributor>
<dc:subject>Graph theory, Edge-colorings, Flows</dc:subject>
<dc:subject>Settore MAT/03 - Geometria</dc:subject>
<dc:description>We consider edge-colorings and flows problems in Graph Theory that are hard to solve for Class 2 graphs. Most of them are strongly related to some outstanding open conjectures, such as the Cycle Double Cover Conjecture, the Berge-Fulkerson Conjecture, the Petersen Coloring Conjecture and the Tutte's 5-flow Conjecture. We obtain some new restrictions on the structure of a possible minimum counterexample to the former two conjectures. We prove that the Petersen graph is, in a specific sense, the only graph that could appear in the Petersen Coloring Conjecture, and we provide evidence that led to propose an analogous of the Tutte's 5-flow conjecture in higher dimensions. We prove a characterization result and a sufficient condition for general graphs in relation to another edge-coloring problem, which is the determination of the palette index of a graph.</dc:description>
<dc:date>2024-04-18</dc:date>
<dc:type>info:eu-repo/semantics/doctoralThesis</dc:type>
<dc:identifier>https://hdl.handle.net/11572/406620</dc:identifier>
<dc:identifier>http://dx.doi.org/10.15168/11572_406620</dc:identifier>
<dc:identifier>10.15168/11572_406620</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>firstpage:1</dc:relation>
<dc:relation>lastpage:125</dc:relation>
<dc:relation>numberofpages:125</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:publisher>Università degli studi di Trento</dc:publisher>
<dc:publisher>place:TRENTO</dc:publisher>
<dc:rights>license:Tutti i diritti riservati (All rights reserved)</dc:rights>
<dc:rights>license uri:iris.PRI01</dc:rights>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>