Have a personal or library account? Click to login
The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks Cover

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
Volume 22 (2012): Issue 3 (September 2012)
By: Piotr Formanowicz and  Krzysztof Tanaś  
Open Access
|Oct 2012
DOI: https://doi.org/10.2478/v10006-012-0057-y | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
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
Keywords:
cubic graph,
edge coloring,
perfect matching,
randomized algorithms,
computer networks
Related subjects:
Mathematics,
Applied mathematics

© 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.

Previous articleVolume 22 (2012): Issue 3 (September 2012)