Colouring ($P_2\cup P_4$, diamond)-free graphs with $ω$ colours
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918268149694464 |
|---|---|
| author | Wang, Hongyang |
| author_facet | Wang, Hongyang |
| contents | In this paper, we establish an optimal $χ$-binding function for $(P_2\cup P_4,\text{ diamond})$-free graphs. We prove that for any graph $G$ in this class, $χ(G)\le 4$ when $ω(G)=2$, $χ(G)\le 6$ when $ω(G)=3$, and $χ(G)=ω(G)$ when $ω(G)\ge 4$, where $χ(G)$ and $ω(G)$ denote the chromatic number and clique number of $G$, respectively. This result extends the known chromatic bounds for $(P_2\cup P_3,\text{ diamond})$-free graphs by showing that $(P_2\cup P_4,\text{ diamond})$-free graphs admit the same $χ$-binding function. It also refines the chromatic bound obtained by Angeliya, Karthick and Huang [arXiv:2501.02543v3 [math.CO], 2025] for $(P_2\cup P_4,\text{ diamond})$-free graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_13128 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Colouring ($P_2\cup P_4$, diamond)-free graphs with $ω$ colours Wang, Hongyang Combinatorics 05C15, 05C17, 05C69, 05C75 In this paper, we establish an optimal $χ$-binding function for $(P_2\cup P_4,\text{ diamond})$-free graphs. We prove that for any graph $G$ in this class, $χ(G)\le 4$ when $ω(G)=2$, $χ(G)\le 6$ when $ω(G)=3$, and $χ(G)=ω(G)$ when $ω(G)\ge 4$, where $χ(G)$ and $ω(G)$ denote the chromatic number and clique number of $G$, respectively. This result extends the known chromatic bounds for $(P_2\cup P_3,\text{ diamond})$-free graphs by showing that $(P_2\cup P_4,\text{ diamond})$-free graphs admit the same $χ$-binding function. It also refines the chromatic bound obtained by Angeliya, Karthick and Huang [arXiv:2501.02543v3 [math.CO], 2025] for $(P_2\cup P_4,\text{ diamond})$-free graphs. |
| title | Colouring ($P_2\cup P_4$, diamond)-free graphs with $ω$ colours |
| topic | Combinatorics 05C15, 05C17, 05C69, 05C75 |
| url | https://arxiv.org/abs/2511.13128 |