Mostra el registre d'ítem simple
Recoloring directed graphs
dc.contributor.author | Felsner, Stefan |
dc.contributor.author | Huemer, Clemens |
dc.contributor.author | Saumell Mendiola, Maria |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II |
dc.date.accessioned | 2010-10-05T18:21:28Z |
dc.date.available | 2010-10-05T18:21:28Z |
dc.date.created | 2009 |
dc.date.issued | 2009 |
dc.identifier.citation | Felsner, S.; Huemer, C.; Saumell, M. Recoloring directed graphs. A: Encuentros de Geometría Computacional. "XIII Encuentros de Geometría Computacional". Zaragoza: Prensas Universitarias de Zaragoza, 2009, p. 91-97. |
dc.identifier.isbn | 978-84-92774-11-1 |
dc.identifier.uri | http://hdl.handle.net/2117/9409 |
dc.description.abstract | Let G be a directed graph and k a positive integer. We define the k-color graph of G (Dk(G) for short) as the directed graph having all k-colorings of G as node set, and where two k-colorings and ' are joined by a directed edge ! ' if ' is obtained from by choosing a vertex v and recoloring v so that its color is different from the colors of all its out-neighbors. We investigate reachability questions in Dk(G). In particular we want to know whether a fixed legal k′-coloring of G with k′ k is reachable in Dk(G) from every possible initial k-coloring . Interesting instances of this problem arise when G is planar and the orientation is an arbitrary -orientation for fixed . Our main result is that reachability can be guaranteed if the orientation has maximal out-degree k − 1 and an accessible pseudo-sink. |
dc.format.extent | 7 p. |
dc.language.iso | eng |
dc.publisher | Prensas Universitarias de Zaragoza |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/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.title | Recoloring directed graphs |
dc.type | Conference report |
dc.subject.lemac | Grafs, Teoria de |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.rights.access | Open Access |
local.identifier.drac | 2446861 |
dc.description.version | Postprint (published version) |
local.citation.author | Felsner, S.; Huemer, C.; Saumell, M. |
local.citation.contributor | Encuentros de Geometría Computacional |
local.citation.pubplace | Zaragoza |
local.citation.publicationName | XIII Encuentros de Geometría Computacional |
local.citation.startingPage | 91 |
local.citation.endingPage | 97 |