Creator:
Formanowicz, Piotr ; Tanaś, Krzysztof
Contributor:
Korbicz, Józef - red. ; Uciński, Dariusz - red.
Title:
Group publication title:
Subject and Keywords:
cubic graph ; edge coloring ; perfect matching ; randomized algorithms ; computer networks
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.
Publisher:
Zielona Góra: Uniwersytet Zielonogórski
Date:
Resource Type:
DOI:
Pages:
Source:
AMCS, Volume 22, Number 3 (2012) ; click here to follow the link