Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 24 Oct 2019 in cs.DM and math.CO | (1910.11394v1)

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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Christopher Duffy 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up