The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks
By: Piotr Formanowicz and Krzysztof Tanaś
References
- Celmins, U.A. and Swart, E. (1979). The constructions of snarks,, No. 18, Department of Combinatorics and Optimization, University of Waterloo, Waterloo.
- Fan, G. and Raspaud, A. (1994). Fulkerson’s conjecture and circuit covers,(1): 133-138.
- Fouquet, J.-L. and Vanherpe, J.-M. (2008). On Fan- Raspaud conjecture,, abs/0809.4821.
- Goldberg, M.K. (1981). Construction of class 2 graphs with maximum vertex degree 3,(3): 282-291.
- Holyer, I. (1981). The NP-completeness of edge coloring,(4): 718-720.
- Isaacs, R. (1975). Infinite families of nontrivial trivalent graphs which are not Tait colorable,(3): 221-239.
- Kochol, M. (1996). Snarks without small cycles,(1): 34-47.
- Greenlaw, R. P. (1995). Cubic graphs,(4): 471-495.
- Szekeres, G. (1973). Polyhedral decompositions of cubic graphs,(3): 367- 387.
- Vizing, V. (1964). On an estimate of the chromatic class of a p-graph,: 25-30.
- Watkins, J. and Wilson, R. (1988). A survey of snarks,Y. Alavi, G. Chartrand, O.R. Oellermann, and A.J. Schwenk (Eds.),, Wiley Interscience, New York, NY/Kalamazoo, MI.
- Watkins, J. (1989). Snarks,: 606-622.
Language: English
Page range: 765 - 778
Published on: Oct 6, 2012
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Related subjects:
© 2012 Piotr Formanowicz, Krzysztof Tanaś, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.