Bookmark Saya

arXiv Open Access 2019

A Note on Colourings of Connected $2$-edge Coloured Cubic Graphs

Christopher Duffy
Lihat Sumber

Abstrak

In this short note we show that every connected $2$-edge coloured cubic graph admits an $10$-colouring. This lowers the best known upper bound for the chromatic number of connected $2$-edge coloured cubic graphs.

Topik & Kata Kunci

cs.DM math.CO

Penulis (1)

C

Christopher Duffy

Format Sitasi

APA MLA BibTeX
Duffy, C. (2019). A Note on Colourings of Connected $2$-edge Coloured Cubic Graphs. https://arxiv.org/abs/1910.11394

Akses Cepat

Lihat di Sumber
Informasi Jurnal
Tahun Terbit
2019
Bahasa
en
Sumber Database
arXiv
Akses
Open Access ✓