A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3
| Author | dc.contributor.author | Lang, Richard | |
| Admission date | dc.date.accessioned | 2016-08-24T18:09:19Z | |
| Available date | dc.date.available | 2016-08-24T18:09:19Z | |
| Publication date | dc.date.issued | 2016 | |
| Cita de ítem | dc.identifier.citation | Graphs and Combinatorics (2016) 32:1055–1064 | en_US |
| Identifier | dc.identifier.other | DOI: 10.1007/s00373-015-1617-3 | |
| Identifier | dc.identifier.uri | https://repositorio.uchile.cl/handle/2250/140241 | |
| General note | dc.description | Artículo de publicación ISI | en_US |
| Abstract | dc.description.abstract | It is shown that Halin graphs are -edge-choosable and that graphs of tree-width 3 are -edge-choosable and -total-colourable. | en_US |
| Lenguage | dc.language.iso | en | en_US |
| Publisher | dc.publisher | Springer | en_US |
| Type of license | dc.rights | Atribución-NoComercial-SinDerivadas 3.0 Chile | * |
| Link to License | dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/cl/ | * |
| Keywords | dc.subject | List edge-coloring | en_US |
| Keywords | dc.subject | Total coloring | en_US |
| Keywords | dc.subject | Halin graphs | en_US |
| Keywords | dc.subject | Tree-width 3 | en_US |
| Título | dc.title | A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3 | en_US |
| Document type | dc.type | Artículo de revista |
Files in this item
This item appears in the following Collection(s)
-
Artículos de revistas
Artículos de revistas
Except where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 3.0 Chile