TY - GEN A1 - Formanowicz, Piotr A1 - Tanaś, Krzysztof A2 - Korbicz, Józef - red. A2 - Uciński, Dariusz - red. PB - Zielona Góra: Uniwersytet Zielonogórski N2 - 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 N2 - 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. L1 - http://www.zbc.uz.zgora.pl/Content/47026/AMCS_2012_22_3_20.pdf L2 - http://www.zbc.uz.zgora.pl/Content/47026 KW - cubic graph KW - edge coloring KW - perfect matching KW - randomized algorithms KW - computer networks T1 - The Fan-Raspaud conjecture: a randomized algorithmic approach and application to the pair assignment problem in cubic networks UR - http://www.zbc.uz.zgora.pl/dlibra/docmetadata?id=47026 ER -