A note on strong edge-colorings of 2-degenerate graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2012
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910384735125504 |
|---|---|
| author | Luo, Rong Yu, Gexin |
| author_facet | Luo, Rong Yu, Gexin |
| contents | We show that every 2-degenerate graph with maximum degree $Δ$ has a strong edge-coloring with at most $8Δ-4$ colors. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1212_6092 |
| institution | arXiv |
| publishDate | 2012 |
| record_format | arxiv |
| spellingShingle | A note on strong edge-colorings of 2-degenerate graphs Luo, Rong Yu, Gexin Combinatorics We show that every 2-degenerate graph with maximum degree $Δ$ has a strong edge-coloring with at most $8Δ-4$ colors. |
| title | A note on strong edge-colorings of 2-degenerate graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/1212.6092 |