On Edge-Colorings of Cubic Graphs and a Formula of Roger Penrose

1988 ◽  
pp. 267-279 ◽  
Author(s):  
F. Jaeger
Keyword(s):  
Cubic Graphs ◽  
Edge Colorings ◽  
Roger Penrose

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

Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems

2007 ◽  
Vol 29 ◽  
pp. 23-27 ◽  
Author(s):  
Daniel Král' ◽  
Edita Máčajová ◽  
Attila Pór ◽  
Jean-Sébastien Sereni
Keyword(s):  
Cubic Graphs ◽  
Steiner Triple Systems ◽  
Triple Systems ◽  
Edge Colorings

scholarly journals The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks

2012 ◽  
Vol 22 (3) ◽  
pp. 765-778
Author(s):  
Piotr Formanowicz ◽  
Krzysztof Tanaś
Keyword(s):  
Graph Theory ◽  
Computer Networks ◽  
Assignment Problem ◽  
Perfect Matchings ◽  
Cubic Graphs ◽  
Cubic Graph ◽  
Algorithmic Approach ◽  
Edge Colorings ◽  
Mathematical Properties

Abstract It was conjectured by Fan and Raspaud (1994) that every bridgeless cubic graph contains three perfect matchings such that every edge belongs to at most two of them. We show a randomized algorithmic way of finding Fan–Raspaud colorings of a given cubic graph and, analyzing the computer results, we try to find and describe the Fan–Raspaud colorings for some selected classes of cubic graphs. The presented algorithms can then be applied to the pair assignment problem in cubic computer networks. Another possible application of the algorithms is that of being a tool for mathematicians working in the field of cubic graph theory, for discovering edge colorings with certain mathematical properties and formulating new conjectures related to the Fan–Raspaud conjecture.

scholarly journals On S-packing edge-colorings of cubic graphs

2019 ◽  
Vol 259 ◽  
pp. 63-75 ◽  
Author(s):  
Nicolas Gastineau ◽  
Olivier Togni
Keyword(s):  
Cubic Graphs ◽  
Edge Colorings

scholarly journals On the Number of 3-Edge Colorings of Cubic Graphs

2002 ◽  
Vol 23 (1) ◽  
pp. 113-120 ◽  
Author(s):  
Christian Szegedy
Keyword(s):  
Cubic Graphs ◽  
Edge Colorings

scholarly journals Circular edge-colorings of cubic graphs with girth six

2010 ◽  
Vol 100 (4) ◽  
pp. 351-358 ◽  
Author(s):  
Daniel Král' ◽  
Edita Máčajová ◽  
Ján Mazák ◽  
Jean-Sébastien Sereni
Keyword(s):  
Cubic Graphs ◽  
Edge Colorings

scholarly journals Circular edge-colorings of cubic graphs with girth six

2009 ◽  
Vol 34 ◽  
pp. 525-529
Author(s):  
Daniel Král' ◽  
Edita Máčajová ◽  
Ján Mazák ◽  
Jean-Sébastien Sereni
Keyword(s):  
Cubic Graphs ◽  
Edge Colorings

scholarly journals Normal 6-edge-colorings of some bridgeless cubic graphs

2020 ◽  
Vol 277 ◽  
pp. 252-262 ◽  
Author(s):  
Giuseppe Mazzuoccolo ◽  
Vahan Mkrtchyan
Keyword(s):  
Cubic Graphs ◽  
Edge Colorings
Sign in / Sign up

Export Citation Format

Share Document