Conflict-free chromatic index of bipartite graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914510082670592 |
|---|---|
| author | Jin, Yuxin Gao, Yuping |
| author_facet | Jin, Yuxin Gao, Yuping |
| contents | An edge coloring of a graph $G$ is called conflict-free if, for every edge, its closed neighborhood contains a color that appears exactly once. The least number of colors required for such a coloring is the conflict-free chromatic index of $G$, denoted by $χ'_{CF}(G)$. Kamyczura, Meszka, and Przybyło conjectured that $χ'_{CF}(G)\le 3$ for any bipartite graph $G$ without isolated vertices. In this paper, we confirm this conjecture. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_24183 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Conflict-free chromatic index of bipartite graphs Jin, Yuxin Gao, Yuping Combinatorics An edge coloring of a graph $G$ is called conflict-free if, for every edge, its closed neighborhood contains a color that appears exactly once. The least number of colors required for such a coloring is the conflict-free chromatic index of $G$, denoted by $χ'_{CF}(G)$. Kamyczura, Meszka, and Przybyło conjectured that $χ'_{CF}(G)\le 3$ for any bipartite graph $G$ without isolated vertices. In this paper, we confirm this conjecture. |
| title | Conflict-free chromatic index of bipartite graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2604.24183 |