首页    期刊浏览 2025年02月08日 星期六
登录注册

文章基本信息

  • 标题:The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks
  • 作者:Piotr Formanowicz ; Krzysztof Tanaś
  • 期刊名称:International Journal of Applied Mathematics and Computer Science
  • 电子版ISSN:2083-8492
  • 出版年度:2012
  • 卷号:22
  • 期号:3
  • DOI:10.2478/v10006-012-0057-y
  • 出版社:De Gruyter Open
  • 摘要: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
  • 关键词:cubic graph; edge coloring; perfect matching; randomized algorithms; computer networks
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有