Access the full text.
Sign up today, get DeepDyve free for 14 days.
Wei Gao, Wei Wang, J. Guirao (2019)
The Extension Degree Conditions for Fractional FactorActa Mathematica Sinica, English Series, 36
Sizhong Zhou (2014)
Remarks on orthogonal factorizations of digraphsInternational Journal of Computer Mathematics, 91
B. Wei, Yongjin Zhu (1997)
Hamiltonian ?-factors in graphsJournal of Graph Theory, 25
Sizhong Zhou, Yang Xu, Zhiren Sun (2019)
Degree conditions for fractional (a, b, k)-critical covered graphsInf. Process. Lett., 152
Hongliang Lu, David Wang (2011)
On Cui‐Kano's Characterization Problem on Graph FactorsJournal of Graph Theory, 74
Sizhong Zhou, Hongxia Liu, Xu Yang (2020)
Binding numbers for fractional (a,b,k)-critical covered graphs
P. Katerinis (1990)
Toughness of graphs and the existence of factorsDiscret. Math., 80
Haruhide Matsuda (2004)
Degree conditions for Hamiltonian graphs to have [a, b]-factors containing a given Hamiltonian cycleDiscret. Math., 280
Li Guizhen (2006)
Fractional Factors and Isolated Toughness of Graphs
Li Yan-jun (2003)
Hamiltonian [k, k + 1]-FactorAdvances in Mathematics
K. Kimura (2013)
Ff-factors, Complete-factors, and Component-deleted SubgraphsDiscret. Math., 313
Xiangyang Lv (2020)
A degree condition for fractional (g, f, n)-critical covered graphs, 5
Sizhong Zhou (2019)
Remarks on path factors in graphsRAIRO Oper. Res., 54
Sizhong Zhou, Zhiren Sun (2020)
Some Existence Theorems on Path Factors with Given Properties in GraphsActa Mathematica Sinica, English Series, 36
L. Lovász (1970)
Subgraphs with prescribed valenciesJournal of Combinatorial Theory, Series A, 8
Liu Shu-li (2010)
Isolated toughness and existence of fractional(g,f)-factors in graphsJournal of Shandong University
Sizhong Zhou, Zhiren Sun (2020)
Binding number conditions for P≥2-factor and P≥3-factor uniform graphsDiscret. Math., 343
Sizhong Zhou, Tao Zhang, Zurun Xu (2020)
Subgraphs with orthogonal factorizations in graphsDiscret. Appl. Math., 286
Marcel Yl, G. Liu (2003)
ISOLATED TOUGHNESS AND THE EXISTENCE OF FRACTIONAL FACTORSActa Mathematicae Applicatae Sinica
Wei Gao, J. Guirao, Yaojun Chen (2019)
A Toughness Condition for Fractional (k, m)-deleted Graphs RevisitedActa Mathematica Sinica, English Series, 35
Chang Ren-ying (2010)
A sufficient condition for (a,b,k)-critical graphsJournal of Shandong University
Sizhong Zhou, Lan Xu, Zurun Xu (2019)
Remarks on Fractional ID-k-factor-critical GraphsActa Mathematicae Applicatae Sinica, English Series, 35
Sizhong Zhou (2019)
Some results about component factors in graphsRAIRO Oper. Res., 53
Xiaofeng Gu (2014)
Regular factors and eigenvalues of regular graphsEur. J. Comb., 42
Yunshu Gao, Guojun Li, Xuechao Li (2009)
Degree condition for the existence of a k-factor containing a given Hamiltonian cycleDiscret. Math., 309
Sizhong Zhou, Fan Yang, Lan Xu (2018)
Two sufficient conditions for the existence of path factors in graphsScientia Iranica
M. Kouider, Saliha Ouatiki (2012)
Sufficient Condition for the Existence of an Even [a, b]-Factor in GraphGraphs and Combinatorics, 29
Let a, b and k be nonnegative integers with a ≥ 2 and b ≥ a(k + 1) + 2. A graph G is called a k-Hamiltonian graph if after deleting any k vertices of G the remaining graph of G has a Hamiltonian cycle. A graph G is said to have a k-Hamiltonian [a, b]-factor if after deleting any k vertices of G the remaining graph of G admits a Hamiltonian [a, b]-factor. Let G is a k-Hamiltonian graph of order n with n ≥ a + k + 2. In this paper, it is proved that G contains a k-Hamiltonian [a, b]-factor if δ(G) ≥ a + k and δ(G)≥I(G)≥a−1+a(k+1)b−2\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\delta \left(G \right) \ge I\left(G \right) \ge a - 1 + {{a\left({k + 1} \right)} \over {b - 2}}$$\end{document}.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Jul 2, 2020
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.