Advanced search
Publication Cover
AKCE International Journal of Graphs and Combinatorics Volume 19, 2022 - Issue 3
Submit an article Journal homepage
669
Views
0
CrossRef citations to date
0
Altmetric
Articles

Binding number and path-factor critical deleted graphs

Yuan Chena Research Center of Nonlinear Science, School of Mathematical and Physical Sciences, Wuhan Textile University, Wuhan, Hubei, P.R. ChinaView further author information
&
Guowei Daib College of Science, Nanjing Forestry University, Nanjing, Jiangsu, P.R. ChinaCorrespondence[email protected]
ORCID Iconhttps://orcid.org/0000-0001-5839-4573View further author information
ORCID Icon
Pages 197-200 | Received 24 Jan 2022, Accepted 18 Jun 2022, Published online: 04 Jul 2022

References

  • Dai, G. (2020). The existence of path-factor covered graphs. Discuss. Math. Graph Theory. https://doi.org/10.7151/dmgt.2353.
  • Dai, G, Hu, Z. (2020). P3-factors in the square of a tree. Graphs Combinat. 36(6): 1913–1925.
  • Dai, G., Zhang, Z., Hang, Y, Zhang, X. (2021). Some degree conditions for P≥3-factor covered graphs, RAIRO-Oper. Res., 55: 2907–2913.
  • Diestel, R. (2005). Graph Theory, 3rd ed. Berlin: Springer.
  • Hua, H. (2021). Toughness and isolated toughness conditions for P≥3-factor uniform graphs, J. Appl. Math. Comput. 66: 809–821.
  • Kaneko, A. (2003). A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. J. Combin. Theory Ser. B 88(2): 195–218.
  • Kano, M., Katona, G. Y, Király, Z. (2004). Packing paths of length at least two. Discr. Math. 283(1-3): 129–135.
  • Kano, M, Tokushige, N. (1992). Binding numbers and f-factors of graphs. J. Combin. Theory Ser. B 54(2): 213–221.
  • Liu, H. (2022). Binding number for path-factor uniform graphs. Proc. Romanian Acad. Ser. A: Math. Phys. Tech. Sci. Inform. Sci. 23(1): 25–32.
  • Nam, Y. (2010). Binding numbers and connected factors. Graphs Combin. 26(6): 805–813.
  • Robertshaw, A, Woodall, D. (2002). Binding number conditions for matching extension. Discr. Math. 248(1-3): 169–179.
  • Plummer, M. D. (2007). Perspectives: Graph factors and factorization: 1985-2003: A survey. Discr. Math. 307(7-8): 791–821.
  • Tutte, W. T. (1952). The factors of graphs. Can. J. Math. 4: 314–328.
  • Woodall, D. (1973). The binding number of a graph and its Anderson number. J. Combin. Theory Ser. B 15(3): 225–255.
  • Yu, Q, Liu, G. (2009). Graph Factors and Matching Extensions, Beijing: Springer Press.
  • Zhou, S. Path factors and neighborhoods of independent sets in graphs. Acta Math. Appl. Sin. English Ser. https://doi.org/10.1007/s10255-022-1096-2.
  • Zhou, S., Bian, Q, Pan, Q. (2021). Path factors in subgraphs. Discr. Appl. Math. https://doi.org/10.1016/j.dam.2021.04.012.
  • Zhou, S, Sun, Z. (2020). Some existence theorems on path factors with given properties in graphs. Acta Math. Sin-English. Ser. 36(8): 917–928.
  • Zhou, S., Wu, J, Bian, Q. (2021). On path-factor critical deleted (or covered) graphs. Aequat. Math. https://doi.org/10.1007/s00010-021-00852-4.
  • Zhou, S., Wu, J, Xu, Y. (2021). Toughness, isolated toughness and path factors in graphs. Bull. Aust. Math. Soc. 1–8. https://doi.org/10.1017/S0004972721000952.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.