An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs

2011 ◽  
pp. 136-146 ◽  
Author(s):  
Edita Máčajová ◽  
Ján Mazák
Keyword(s):  
Cubic Graphs ◽  
Edge Colouring

scholarly journals Three-edge-colouring doublecross cubic graphs

2016 ◽  
Vol 119 ◽  
pp. 66-95 ◽  
Author(s):  
Katherine Edwards ◽  
Daniel P. Sanders ◽  
Paul Seymour ◽  
Robin Thomas
Keyword(s):  
Cubic Graphs ◽  
Edge Colouring

scholarly journals Delay Colourings of Cubic Graphs

10.37236/2920 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Agelos Georgakopoulos
Keyword(s):  
Cubic Graphs ◽  
Special Case ◽  
Edge Colouring

In this note we prove the conjecture of  Wilfong, Haxell and Winkler (2001) that every bipartite multi-graph with integer edge delays admits an edge colouring with $d+1$ colours in the special case when $d = 3$.

scholarly journals Reflexive coloring complexes for 3-edge-colorings of cubic graphs

2021 ◽  
Vol 344 (4) ◽  
pp. 112309
Author(s):  
Fiachra Knox ◽  
Bojan Mohar ◽  
Nathan Singer
Keyword(s):  
Cubic Graphs ◽  
Edge Colorings

scholarly journals Cyclically five-connected cubic graphs

2017 ◽  
Vol 125 ◽  
pp. 132-167 ◽  
Author(s):  
Neil Robertson ◽  
P.D. Seymour ◽  
Robin Thomas
Keyword(s):  
Cubic Graphs

Cubic Graphs with Large Girth

1989 ◽  
Vol 555 (1 Combinatorial) ◽  
pp. 56-62 ◽  
Author(s):  
N. L. BIGGS
Keyword(s):  
Cubic Graphs ◽  
Large Girth

scholarly journals An upper bound on the domination number of n-vertex connected cubic graphs

2009 ◽  
Vol 309 (5) ◽  
pp. 1142-1162 ◽  
Author(s):  
A.V. Kostochka ◽  
B.Y. Stodolsky
Keyword(s):  
Upper Bound ◽  
Domination Number ◽  
Cubic Graphs

Splitter Theorems for Cubic Graphs

2006 ◽  
Vol 15 (03) ◽  
pp. 355 ◽  
Author(s):  
GUOLI DING ◽  
JINKO KANNO
Keyword(s):  
Cubic Graphs

scholarly journals Even cycles with prescribed chords in planar cubic graphs

1983 ◽  
Vol 44 (3) ◽  
pp. 275-280 ◽  
Author(s):  
Herbert Fleischner
Keyword(s):  
Cubic Graphs
Sign in / Sign up

Export Citation Format

Share Document