Mostra el registre d'ítem simple
Ohba’s conjecture and beyond for generalized colorings
dc.contributor | Serra Albó, Oriol |
dc.contributor.author | Delgado Calvache, Alba |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2017-07-24T13:04:25Z |
dc.date.available | 2017-07-24T13:04:25Z |
dc.date.issued | 2017-07 |
dc.identifier.uri | http://hdl.handle.net/2117/106757 |
dc.description.abstract | Let $G$ be a graph. Ohba's conjecture states that if $|V(G)|\leq 2\chi(G) +1$, then $\chi(G)=\chi^L(G)$. Noel, West, Wu and Zhu extended this result and proved that for any graph, $\chi^L(G)\leq\max\{\chi(G),\left\lceil(|V(G)+\chi(G)-1)/3\right\rceil\}$. Ohba, Kierstead and Noel proved that this bound is sharp for the ordinary chromatic number. In this work we prove that both results hold for generalized colorings as well, and find examples that prove the sharpness of the second one for the acyclic and star chromatic numbers. |
dc.language.iso | eng |
dc.publisher | Universitat Politècnica de Catalunya |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
dc.subject.lcsh | Graph theory |
dc.subject.other | Graph theory |
dc.subject.other | List coloring |
dc.subject.other | Choosability |
dc.title | Ohba’s conjecture and beyond for generalized colorings |
dc.type | Master thesis |
dc.subject.lemac | Grafs, Teoria de |
dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
dc.identifier.slug | FME-1513 |
dc.rights.access | Open Access |
dc.date.updated | 2017-07-20T05:22:51Z |
dc.audience.educationlevel | Màster |
dc.audience.mediator | Universitat Politècnica de Catalunya. Facultat de Matemàtiques i Estadística |
dc.audience.degree | MÀSTER UNIVERSITARI EN MATEMÀTICA AVANÇADA I ENGINYERIA MATEMÀTICA (Pla 2010) |