K-Factors and Hamilton Cycles in Graphs 被引量：1

K-Factors and Hamilton Cycles in Graphs

导出

摘要 We discuss k-factors and Hamiltonian Graphs in graph theory. We prove a general version of the conjecture by R. Haggkvist; as a result, we prove two extended versions of two well-known theorems due to O. Ore and B. Jachson, respectively. We discuss k-factors and Hamiltonian Graphs in graph theory. We prove a general version of the conjecture by R. Haggkvist; as a result, we prove two extended versions of two well-known theorems due to O. Ore and B. Jachson, respectively.

作者 Zhi Guo WANG Zhen Jiang ZHAO

机构地区 College of Mathematics and Information Sciences P. O. Box

出处《Acta Mathematica Sinica,English Series》 SCIE CSCD 2007年第2期309-312,共4页 数学学报（英文版）

基金 supported by the Key Laboratory of Power System,Tsinghua University

关键词 K-FACTOR 2-connected graph Hamilton cycle k-factor, 2-connected graph, Hamilton cycle

分类号 O157.5 [理学—基础数学]

引文网络
相关文献

参考文献1

1LinFanMAO,YanPeiLIU,FengTIAN.Automorphisms of Maps with a Given Underlying Graph and Their Application to Enumeration[J].Acta Mathematica Sinica,English Series,2005,21(2):225-236. 被引量：2

二级参考文献17

1Liu.Y.P.:Enumerative Theory of Maps,Kluwer Academic Publisher,Dordrecht,Boston,London,1999.
2Biggs.N.L.:Automorphisms of imbedded graphs.J.Combin.Theory,11,132—138(1971).
3Biggs,N.L.,White,A.T.:Permutation Groups and Combinatoric Structure,Cambridge University Press,Cambridge,1979.
4Mull,B.P.,Rieper,R G.,White,A.T.:Enumeration 2-cell imbeddings of connected graphs.Proc.Amer.Math.Soc.,103,321-330(1988).
5Mull.B.P.；Enamerating the orientable 2-cell imbeddings of complete bipartite graphs.J.Graph Theory,30(2).77—90 (1999).
6Tutte.W.T.:What is a maps?in“New Directions in the Theory of Graphs”(ed.by F.Harary),Academic Press,309-325,1973.
7Mao,L.F.,Liu Y.P.,Tian,F.:0n the number of complete maps on surfaces.Submitted to Discrete Math.
8Mao,L.F.,Liu,Y P.:Automorphisms of maps with underlying Cayley graph and its application to enumeration.Submitted to Discrete Math.
9Liskovets,V.A.:Enumeration of non—isomorphic planar maps.Sel.Math.Sov.,4(4),303—323(1985).
10Liskovets,V.A.:A reductive technique for Enumerating non-isomorphic planar maps.Discrete Math,156,197-217(1996).

共引文献1

1Zhao Lin JIANG,Yun Cheng QIAO,Shu Dong WANG.Norm Equalities and Inequalities for Three Circulant Operator Matrices[J].Acta Mathematica Sinica,English Series,2017,33(4):571-590.

同被引文献2

1刘红霞.r-正则图的边连通度和k-对等性质[J].烟台大学学报（自然科学与工程版）,2006,19(2):79-82. 被引量：1
2刘红霞,方小娟.有1-因子的图和(g,f)-对等图[J].烟台大学学报（自然科学与工程版）,2007,20(4):235-239. 被引量：1

引证文献1

1刘红霞,乔贵平.图的邻域并和连通的[k,k+1]-因子[J].烟台大学学报（自然科学与工程版）,2013,26(1):1-3.

1DU BEILIANG.K_(1,k)-FACTORIZATION OF BIPARTITE GRAPHS[J].Applied Mathematics(A Journal of Chinese Universities),1997,12(4):121-126. 被引量：2
2支志兵.容斥原理在汉密尔顿问题中的应用[J].数学理论与应用,2014,34(2):118-123.
3李永康.伴随矩阵的一个性质[J].桂林师范高等专科学校学报,1996,11(3):50-54. 被引量：1
4张忠志,胡锡炎,张磊.线性流形上反埃尔米特广义汉密尔顿矩阵的最小二乘问题与最佳逼近问题[J].数学物理学报（A辑）,2006,26(6):978-986. 被引量：8
5杜玉霞,梁武,费时龙,化文兰,汪洪燕.矩阵方程(AX,YA)=(B_1,B_2)的反埃尔米特广义汉密尔顿解[J].阴山学刊（自然科学版）,2016,30(4):14-15.
6ICM2006汉密尔顿作“庞加莱猜想”一小时报告(摘要)[J].高等数学研究,2007,10(1):7-7.
7朱永津,刘振宏,俞正光.2-CONNECTED K-REGULAR GRAPHS ON AT MOST 3k+3 VERTICES TO BE HAMILTONIAN[J].Chinese Science Bulletin,1985,30(9).
8WANG Zhi-guo,ZHANG Yi.k-Factors and Spanning Subgraph in Graphs[J].Chinese Quarterly Journal of Mathematics,2006,21(1):143-147.
9Du BeiliangDept.ofMath.,SuzhouUniv.,Suzhou215006.E-mail:dubl@pub.sz.jsinfo.ne.K_(1,p)~k-FACTORIZATION OF COMPLETE BIPARTITE GRAPHS[J].Applied Mathematics(A Journal of Chinese Universities),2001,16(2):107-110. 被引量：3
10张忠志,胡锡炎,张磊.线性矩阵方程的埃尔米特广义反汉密尔顿半正定解[J].数学物理学报（A辑）,2006,26(4):612-620. 被引量：3

Acta Mathematica Sinica,English Series

2007年第2期

浏览历史

内容加载中请稍等...