◍wovepaper
SearchResearchersInstitutions
Sign in
cs.DMOct 24, 2019
authors
  • Christopher Duffy
arXiv abstractPDF
paper

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

arXiv:1910.11394

Abstract

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.

References in corpus (2)

  • Homomorphisms of signed planar graphs
  • Signified chromatic number of grids is at most 9
◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.