AI Chat AI Image Generator AI Video Text to Speech

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

10/24/2019
∙
by   Christopher Duffy, et al.
∙
0
∙

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 08/08/2019

A Note on Colourings of Connected Oriented Cubic Graphs

In this short note we show that every connected oriented cubic graph adm...
0 Christopher Duffy, et al. ∙
research
∙ 06/12/2018

On the minimum leaf number of cubic graphs

The minimum leaf number ml (G) of a connected graph G is defined as the ...
0 Jan Goedgebeur, et al. ∙
research
∙ 05/04/2021

Switching 3-edge-colorings of cubic graphs

The chromatic index of a cubic graph is either 3 or 4. Edge-Kempe switch...
0 Jan Goedgebeur, et al. ∙
research
∙ 01/23/2019

Embedding quadratization gadgets on Chimera and Pegasus graphs

We group all known quadratizations of cubic and quartic terms in binary ...
1 Nike Dattani, et al. ∙
research
∙ 12/17/2017

Cuts in matchings of 3-edge-connected cubic graphs

We discuss relations between several known (some false, some open) conje...
0 Kolja Knauer, et al. ∙
research
∙ 05/17/2018

On two consequences of Berge-Fulkerson conjecture

The classical Berge-Fulkerson conjecture states that any bridgeless cubi...
0 Vahan V. Mkrtchyan, et al. ∙
research
∙ 08/02/2023

Signed double Roman domination on cubic graphs

The signed double Roman domination problem is a combinatorial optimizati...
0 Enrico Iurlano, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal