关于3正则图的三匹配交猜想 (Ⅱ)(英文)
关于3正则图的三匹配交猜想（Ⅱ）
摘要
In 1994, FAN and RASPAUD posed the following conjecture: every bridgeless cubic graph contains three perfect matchings M 1, M 2 and M 3 such that M 1∩M 2∩M 3=*I.In this paper we obtain the following result: let G be a cyclely-4-edge-connected cubic graph, which has a perfect matching M 1 such that G-M 1 consists of four odd cycles. Then G contains two perfect matchings M 2 and M 3 such that M 1∩M 2∩M 3=*I.
参考文献11
-
1BERMOND J C,JACKSON B,JAEGER F.Shortest covering of graphs with cycles[J]. J Combin Theory,1983,35B:297-308.
-
2CELMIUS U A. On Cubic Graphs That Do Not Have an Edge-3-Coloring[D].Waterloo:University of Waterloo,1984.
-
3EDMONDS J. Maximum matching and a polyhedron with 0,1-vertices[J]. J Res Nat BurStandards Sect,1965,69B:125-130.
-
4FAN G,RASPAUD A. Fulkerson's Conjecture and circuit covers[J]. JCombin,1994,61B:133-138.
-
5FAN G. Integer flows and cycle covers[J]. J Combin,1992,54B:113-122.
-
6FULKERSON D R. Blocking and anti-blocking parts of polyhedra[J]. MathProgramming,1971,1:168-194.
-
7GODDYN L. Workshop on Cycles and Rays[R]. Montréal,1987.
-
8JAEGER F. Nowhere-zero Flow Problems[M]. Lodon:Academic Press,1988.71-95.
-
9SEYMOUR P D. Sums of Circuits[M]. New York:Academic Press,1979.341-355.
-
10SEYMOUR P D. On multi-colorings of cubic graphs,and conjectures of Fulkerson andTutte[J]. Proc London Math Soc,1979,38(3):423-460.
-
1王广富,王燕.3-连通图支撑树上的可去边数[J].甘肃科学学报,2007,19(3):9-11.
-
2宋晓新.关于3正则图的三匹配交猜想(I)[J].数学研究,2002,35(4):397-405.
-
3秦玉祥.2边连通3正则平面图的边着色[J].中国民航学院学报,1998,16(3):68-73.
-
4任韩,魏二玲.消圈数与图的嵌入（英文）[J].数学进展,2016,45(3):349-356.
-
5郝荣霞,赖虹建,刘浩洋.关于2-边连通3正则图荫度的一个注（英文）[J].数学进展,2015,44(6):865-870.
-
6魏二玲,李益凡.广义Petersen图的消圈数与上可嵌入性[J].数学学报（中文版）,2013,56(2):211-216. 被引量：2
-
7杨随义,邵海琴,何万生.两类3正则图的邻点可区别E全染色[J].西南师范大学学报（自然科学版）,2013,38(3):36-41.
-
8唐保祥,任韩.两类3正则图中的完美匹配数[J].中山大学学报（自然科学版）,2014,53(5):54-58. 被引量：4
-
9欧见平,张福基.3限制边连通度与正则因子[J].数学物理学报（A辑）,2003,23(6):650-654.
-
10颜荔融.几种特殊图类的圈权估计[J].福州大学学报（自然科学版）,1992,20(1):16-20.
