The chromatic index of strongly regular graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2018
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918189219184640 |
|---|---|
| author | Cioaba, Sebastian M. Guo, Krystal Haemers, Willem H. |
| author_facet | Cioaba, Sebastian M. Guo, Krystal Haemers, Willem H. |
| contents | We determine (partly by computer search) the chromatic index (edge-chromatic number) of many strongly regular graphs (SRGs), including the SRGs of degree $k \leq 18$ and their complements, the Latin square graphs and their complements, and the triangular graphs and their complements. Moreover, using a recent result of Ferber and Jain it is shown that an SRG of even order $n$, which is not the block graph of a Steiner 2-design or its complement, has chromatic index $k$, when $n$ is big enough. Except for the Petersen graph, all investigated connected SRGs of even order have chromatic index equal to their degree, i.e., they are class 1, and we conjecture that this is the case for all connected SRGs of even order. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1810_06660 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | The chromatic index of strongly regular graphs Cioaba, Sebastian M. Guo, Krystal Haemers, Willem H. Combinatorics 05C15, 05E30 We determine (partly by computer search) the chromatic index (edge-chromatic number) of many strongly regular graphs (SRGs), including the SRGs of degree $k \leq 18$ and their complements, the Latin square graphs and their complements, and the triangular graphs and their complements. Moreover, using a recent result of Ferber and Jain it is shown that an SRG of even order $n$, which is not the block graph of a Steiner 2-design or its complement, has chromatic index $k$, when $n$ is big enough. Except for the Petersen graph, all investigated connected SRGs of even order have chromatic index equal to their degree, i.e., they are class 1, and we conjecture that this is the case for all connected SRGs of even order. |
| title | The chromatic index of strongly regular graphs |
| topic | Combinatorics 05C15, 05E30 |
| url | https://arxiv.org/abs/1810.06660 |