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

Piotr Formanowicz, Krzysztof Tanaś
2012 International Journal of Applied Mathematics and Computer Science  
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.
more » ... her 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.
doi:10.2478/v10006-012-0057-y fatcat:4hmv2f35ivgwfptplv3zo5um6m