Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.04526 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909096432631808 |
|---|---|
| author | Wang, Yichen Lu, Mei |
| author_facet | Wang, Yichen Lu, Mei |
| contents | A star edge coloring of a graph $G$ is a proper edge coloring with no 2-colored path or cycle of length four. The star edge coloring problem is to find an edge coloring of a given graph $G$ with minimum number $k$ of colors such that $G$ admits a star edge coloring with $k$ colors. This problem is known to be NP-complete. In this paper, for a bounded treewidth graph with given maximum degree, we show that it can be solved in polynomial time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_04526 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree Wang, Yichen Lu, Mei Combinatorics A star edge coloring of a graph $G$ is a proper edge coloring with no 2-colored path or cycle of length four. The star edge coloring problem is to find an edge coloring of a given graph $G$ with minimum number $k$ of colors such that $G$ admits a star edge coloring with $k$ colors. This problem is known to be NP-complete. In this paper, for a bounded treewidth graph with given maximum degree, we show that it can be solved in polynomial time. |
| title | A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2402.04526 |