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.
@article{bwmeta1.element.bwnjournal-article-amcv22z3p765bwm,
author = {Piotr Formanowicz and Krzysztof Tana\'s},
title = {The Fan-Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks},
journal = {International Journal of Applied Mathematics and Computer Science},
volume = {22},
year = {2012},
pages = {765-778},
zbl = {1304.05044},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-amcv22z3p765bwm}
}
Piotr Formanowicz; Krzysztof Tanaś. The Fan-Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks. International Journal of Applied Mathematics and Computer Science, Tome 22 (2012) pp. 765-778. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-amcv22z3p765bwm/
[000] Celmins, U.A. and Swart, E. (1979). The constructions of snarks, Research Report CORR, No. 18, Department of Combinatorics and Optimization, University of Waterloo, Waterloo.
[001] Fan, G. and Raspaud, A. (1994). Fulkerson's conjecture and circuit covers, Journal of Combinatorial Theory, Series B 61(1): 133-138. | Zbl 0811.05053
[002] Fouquet, J.-L. and Vanherpe, J.-M. (2008). On Fan-Raspaud conjecture, CoRR-Computing Research Repository, abs/0809.4821.
[003] Goldberg, M.K. (1981). Construction of class 2 graphs with maximum vertex degree 3, Journal of Combinatorial Theory, Series B 31(3): 282-291. | Zbl 0449.05037
[004] Holyer, I. (1981). The NP-completeness of edge coloring, SIAM Journal on Computing 10(4): 718-720. | Zbl 0473.68034
[005] Isaacs, R. (1975). Infinite families of nontrivial trivalent graphs which are not Tait colorable, American Mathematical Monthly 82(3): 221-239. | Zbl 0311.05109
[006] Kochol, M. (1996). Snarks without small cycles, Journal of Combinatorial Theory, Series B 67(1): 34-47. | Zbl 0855.05066
[007] Greenlaw, R. P. (1995). Cubic graphs, ACM Computing Surveys 27(4): 471-495.
[008] Szekeres, G. (1973). Polyhedral decompositions of cubic graphs, Bulletin of the Australian Mathematical Society 8(3): 367-387. | Zbl 0249.05111
[009] Vizing, V. (1964). On an estimate of the chromatic class of a p-graph, Diskretnyj Analiz 3: 25-30.
[010] Watkins, J. and Wilson, R. (1988). A survey of snarks, in Y. Alavi, G. Chartrand, O.R. Oellermann, and A.J. Schwenk (Eds.), Graph Theory, Combinatorics, and Applications, Wiley Interscience, New York, NY/Kalamazoo, MI. | Zbl 0841.05035
[011] Watkins, J. (1989). Snarks, Annals of the New York Academy of Sciences 576: 606-622. | Zbl 0792.05057