[Une condition sur le degré minimal pour qu'un graphe soit
Soit G un graphe d'ordre n et
Let G be a graph of order n, and let
Accepté le :
Publié le :
Sizhong Zhou 1
@article{CRMATH_2009__347_21-22_1223_0, author = {Sizhong Zhou}, title = {A minimum degree condition of fractional $ (k,m)$-deleted graphs}, journal = {Comptes Rendus. Math\'ematique}, pages = {1223--1226}, publisher = {Elsevier}, volume = {347}, number = {21-22}, year = {2009}, doi = {10.1016/j.crma.2009.09.022}, language = {en}, }
Sizhong Zhou. A minimum degree condition of fractional $ (k,m)$-deleted graphs. Comptes Rendus. Mathématique, Volume 347 (2009) no. 21-22, pp. 1223-1226. doi : 10.1016/j.crma.2009.09.022. https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.1016/j.crma.2009.09.022/
[1] Graph Theory with Applications, The Macmillan Press, London, 1976
[2] Minimun degree of a graph and the existence of k-factors, Proc. Indian Acad. Sci. Math. Sci., Volume 94 (1985), pp. 123-127
[3] Fractional
[4] Toughness and the existence of fractional k-factors of graphs, Discrete Math., Volume 308 (2008), pp. 1741-1748
[5] A degree condition for graphs to have fractional factors, Adv. Math. (China), Volume 35 (2006) no. 5, pp. 621-628
[6] S. Zhou, Z. Duan, Binding number and fractional k-factors of graphs, Ars Combin., in press
- Sharp Isolated Toughness Bound for Fractional (k, m)-Deleted Graphs, Acta Mathematicae Applicatae Sinica, English Series, Volume 41 (2025) no. 1, p. 252 | DOI:10.1007/s10255-024-1067-x
- A sufficient condition for the existence of a k-factor excluding a given r-factor, Applied Mathematics and Nonlinear Sciences, Volume 2 (2017) no. 1, p. 13 | DOI:10.21042/amns.2017.1.00002
- Degree Conditions for Fractional
( g , f , n ′ , m ) -Critical Deleted Graphs and Fractional ID-(g, f, m)-Deleted Graphs, Bulletin of the Malaysian Mathematical Sciences Society, Volume 39 (2016) no. S1, p. 315 | DOI:10.1007/s40840-015-0194-1 - Binding numbers for fractional ID-k-factor-critical graphs, Acta Mathematica Sinica, English Series, Volume 30 (2014) no. 1, p. 181 | DOI:10.1007/s10114-013-1396-9
- A toughness condition for fractional -deleted graphs, Information Processing Letters, Volume 113 (2013) no. 8, p. 255 | DOI:10.1016/j.ipl.2013.01.021
- A new neighborhood condition for graphs to be fractional (k,m)-deleted graphs, Applied Mathematics Letters, Volume 25 (2012) no. 3, p. 509 | DOI:10.1016/j.aml.2011.09.048
- A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS, Bulletin of the Australian Mathematical Society, Volume 86 (2012) no. 2, p. 177 | DOI:10.1017/s0004972711003467
- Some new sufficient conditions for graphs to have fractionalk-factors, International Journal of Computer Mathematics, Volume 88 (2011) no. 3, p. 484 | DOI:10.1080/00207161003681286
Cité par 8 documents. Sources : Crossref
☆ This research was supported by Jiangsu Provincial Educational Department (07KJD110048) and was sponsored by Qing Lan Project of Jiangsu Province.
Commentaires - Politique