Skip Navigation



Journal of the London Mathematical Society Advance Access published online on February 15, 2008
Journal of the London Mathematical Society, doi:10.1112/jlms/jdm117
This Article
Right arrow FREE Full Text (PDF) Freely available
Right arrow Supplementary Data
Right arrow All Versions of this Article:
77/2/387    most recent
jdm117v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cariolaro, D.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2008 London Mathematical Society

1-Factorization of regular graphs by colour exchange

David Cariolaro

Institute of Mathematics
Academia Sinica
Nankang
Taipei 11529
Taiwan

We present a new general theory that deals with the problem of determining a 1-factorization of a graph using only the elementary technique of colour exchange. Our work is inspired by an old question of Vizing, who in [Cybernetics 3 (1965) 32–41] asked whether an optimal edge colouring of any multigraph G can always be obtained from an arbitrary edge colouring of G by repeatedly exchanging colours along bicoloured chains and suppressing empty colour classes. We conjecture that the answer to Vizing's question is affirmative. We apply our theory to the class of regular graphs of even order at most 10, proving the validity of this conjecture for this class of graphs. This yields an algorithm for finding a 1-factorization of any 1-factorizable graph of order at most 10. We also formulate two (stronger) conjectures and prove that they hold for the same class of graphs. Our method can be extended to graphs of larger order and to non-regular graphs or multigraphs.

Dedicated to the memory of Professor C. St. J. A. Nash-Williams

2000 Mathematics Subject Classification 05C15, 05C70.

Received February 1, 2007; revised September 14, 2007;
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.