2-连通［4,1］-图的Hamilton圈

J4 ›› 2011, Vol. 24 ›› Issue (1): 68-71.

ZHANG Wei, WANG Jiang-Lu

CLC Number:

ZHANG Wei, WANG Jiang-Lu. Hamilton cycles of 2-connected ［4,1］-graphs[J].J4, 2011, 24(1): 68-71.

[1]	QIN Xue-jiao. Fault-tolerant analysis of3-ary n-cubes with conditional faults [J]. Shandong Science, 2021, 34(4): 114-119.
[2]	XU Zi-jun,ZHANG Lei. Sufficient conditions of a maximally 3-isoperimetric edge connected graph [J]. SHANDONG SCIENCE, 2016, 29(4): 75-79.
[3]	WANG Meiyu, WANG Shiying. Sufficient conditions of a maximally 3restricted edge connected graph [J]. SHANDONG SCIENCE, 2015, 28(3): 80-83.
[4]	WANG Xiao-Li, WANG Shi-Ying. Lower bounds of the arcconnectivity of a nonmaximally arc-connected digraph [J]. J4, 2014, 27(1): 98-101.
[5]	GAO Jing-Zhen, SHAO Guang-Feng. Neighborhood conditions of maximally local edge connected and super local edge connected bipartite digraphs [J]. J4, 2012, 25(2): 1-7.
[6]	CHEN Wei-Na, WANG Jiang-Lu. Hamilton cycle of 2-connected P₃-dominated graphs [J]. Shandong Science, 2011, 24(6): 8-11.
[7]	HUANG Li, GAO Jing-Zhen. A neighborhood condition of a super -λ_k trianglefree graph [J]. J4, 2011, 24(2): 1-5.
[8]	GAO Jing-Zhen, MA Yu. Sufficient conditions of a λ₄- optimal and super -λ₄ graph [J]. J4, 2011, 24(1): 61-64.
[9]	GAO Jing-Zhen, HUANG Li. Neighborhood Intersection Conditions for λ₄-Optimality of a Graph [J]. J4, 2010, 23(6): 5-8.

PDF (PC)