Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.creator | Bonomo, Flavia | - |
dc.creator | Cecowski Palacio, Mariano | - |
dc.date | 2017-04-06T20:43:03Z | - |
dc.date | 2017-04-06T20:43:03Z | - |
dc.date | 2011-05 | - |
dc.date | 2017-04-05T15:12:42Z | - |
dc.date.accessioned | 2019-04-29T15:43:01Z | - |
dc.date.available | 2019-04-29T15:43:01Z | - |
dc.date.issued | 2011-05 | - |
dc.identifier | Bonomo, Flavia; Cecowski Palacio, Mariano; Between coloring and list-coloring: μ-coloring; Charles Babbage Res Ctr; Ars Combinatoria; 99; 5-2011; 383-398 | - |
dc.identifier | 0381-7032 | - |
dc.identifier | http://hdl.handle.net/11336/14910 | - |
dc.identifier.uri | http://rodna.bn.gov.ar:8080/jspui/handle/bnmm/300217 | - |
dc.description | A new variation of the coloring problem, mu-coloring, is defined in this paper. A coloring of a graph G = (V,E) is a function f: V -> N such that f(v) is different from f(w) if v is adjacent to w. Given a graph G = (V,E) and a function mu: V -> N, G is mu-colorable if it admits a coloring f with f(v)<= mu(v) for each v in V. It is proved that mu-coloring lies between coloring and list-coloring, in the sense of generalization of problems and computational complexity. Besides, the notion of perfection is extended to mu-coloring, giving rise to a new characterization of cographs. Finally, a polynomial time algorithm to solve mu-coloring for cographs is shown. | - |
dc.description | Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas "Luis A. Santaló"; Argentina | - |
dc.description | Fil: Cecowski Palacio, Mariano. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina | - |
dc.format | application/pdf | - |
dc.format | application/pdf | - |
dc.language | eng | - |
dc.publisher | Charles Babbage Res Ctr | - |
dc.relation | info:eu-repo/semantics/altIdentifier/url/http://www.combinatorialmath.ca/arscombinatoria/vol99.html | - |
dc.rights | info:eu-repo/semantics/restrictedAccess | - |
dc.rights | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | - |
dc.source | reponame:CONICET Digital (CONICET) | - |
dc.source | instname:Consejo Nacional de Investigaciones Científicas y Técnicas | - |
dc.source | instacron:CONICET | - |
dc.subject | Cographs | - |
dc.subject | Coloring | - |
dc.subject | List-coloring | - |
dc.subject | μ-coloring | - |
dc.subject | M-perfect graphs | - |
dc.subject | Perfect graphs | - |
dc.subject | Matemática Aplicada | - |
dc.subject | Matemáticas | - |
dc.subject | CIENCIAS NATURALES Y EXACTAS | - |
dc.subject | Ciencias de la Computación | - |
dc.subject | Ciencias de la Computación e Información | - |
dc.subject | CIENCIAS NATURALES Y EXACTAS | - |
dc.title | Between coloring and list-coloring: μ-coloring | - |
dc.type | info:eu-repo/semantics/article | - |
dc.type | info:eu-repo/semantics/publishedVersion | - |
dc.type | info:ar-repo/semantics/articulo | - |
Aparece en las colecciones: | CONICET |
Ficheros en este ítem:
No hay ficheros asociados a este ítem.