Show simple item record

dc.contributor.authorFelsner, Stefan
dc.contributor.authorHuemer, Clemens
dc.contributor.authorSaumell Mendiola, Maria
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II
dc.date.accessioned2010-10-05T18:21:28Z
dc.date.available2010-10-05T18:21:28Z
dc.date.created2009
dc.date.issued2009
dc.identifier.citationFelsner, 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.isbn978-84-92774-11-1
dc.identifier.urihttp://hdl.handle.net/2117/9409
dc.description.abstractLet 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.extent7 p.
dc.language.isoeng
dc.publisherPrensas Universitarias de Zaragoza
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://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.lcshGraph theory
dc.titleRecoloring directed graphs
dc.typeConference report
dc.subject.lemacGrafs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
dc.rights.accessOpen Access
local.identifier.drac2446861
dc.description.versionPostprint (published version)
local.citation.authorFelsner, S.; Huemer, C.; Saumell, M.
local.citation.contributorEncuentros de Geometría Computacional
local.citation.pubplaceZaragoza
local.citation.publicationNameXIII Encuentros de Geometría Computacional
local.citation.startingPage91
local.citation.endingPage97


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain