The number of cut-edges and conflict-free connection number in planar graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914620280668160 |
|---|---|
| author | Ha, Pham Hoang Hanh, Dang Dinh Minh, Vu Quang |
| author_facet | Ha, Pham Hoang Hanh, Dang Dinh Minh, Vu Quang |
| contents | A \textit{cut-edge} of a connected graph is an edge whose deletion increases the number of components. In this paper, we first state some conditions for a planar graph to have a few cut-edges. After that, we use the main results to study the conditions for a colored planar graph to have a bounded conflict-free connection number. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2606_00533 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The number of cut-edges and conflict-free connection number in planar graphs Ha, Pham Hoang Hanh, Dang Dinh Minh, Vu Quang Combinatorics A \textit{cut-edge} of a connected graph is an edge whose deletion increases the number of components. In this paper, we first state some conditions for a planar graph to have a few cut-edges. After that, we use the main results to study the conditions for a colored planar graph to have a bounded conflict-free connection number. |
| title | The number of cut-edges and conflict-free connection number in planar graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2606.00533 |