A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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.doi:10.2478/v10006-012-0057-y fatcat:4hmv2f35ivgwfptplv3zo5um6m