Skip to main content
Log in

Some Existence Theorems on Path Factors with Given Properties in Graphs

  • Published:
Acta Mathematica Sinica, English Series Aims and scope Submit manuscript

Abstract

A path factor of G is a spanning subgraph of G such that its each component is a path. A path factor is called a Pn-factor if its each component admits at least n vertices. A graph G is called Pn-factor covered if G admits a Pn-factor containing e for any eE(G), which is defined by [Discrete Mathematics, 309, 2067–2076 (2009)]. We first define the concept of a (Pn, k)-factor-critical covered graph, namely, a graph G is called (Pn, k)-factor-critical covered if G-D is Pn-factor covered for any DV(G)with ∣D∣ = k. In this paper, we verify that (i) a graph G with k(G) ≥ k + 1 is (P2, k)-factor-critical covered if bind \(\left( G \right) > {{2 + k} \over 3}\); (ii) a graph G with ∣V(G)∣ ≥ k + 3 and k(G) ≥ k + 1 is (P3, k)-factor-critical covered if bind\(\left( G \right) \ge {{4 + k} \over 3}\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Akiyama, J., Avis, D., Era, H.: On a {1, 2}-factor of a graph. TRU Math., 16, 97–102 (1980)

    MathSciNet  MATH  Google Scholar 

  2. Asratian, A., Casselgren, C.: On path factors of (3,4)-biregular bigraphs. Graphs and Combinatorics, 24, 405–411 (2008)

    Article  MathSciNet  Google Scholar 

  3. Gao, W., Dimitrov, D., Abdo, H.: Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs. Discrete and Continuous Dynamical Systems-Series S, 12(4–5), 711–721 (2019)

    Article  MathSciNet  Google Scholar 

  4. Gao, W., Guirao, J.: Parameters and fractional factors in different settings. Journal of Inequalities and Applications, 152, (2019), https://doi.org/10.1186/s13660-019-2106-7

  5. Gao, W., Guirao, J., Chen, Y.: A toughness condition for fractional (k, m)-deleted graphs revisited. Acta Mathematica Sinica, English Series, 35(7), 1227–1237 (2019)

    Article  MathSciNet  Google Scholar 

  6. Johnson, M., Paulusma, D., Wood, C.: Path factors and parallel knock-out schemes of almost claw-free graphs. Discrete Mathematics, 310, 1413–1423 (2010)

    Article  MathSciNet  Google Scholar 

  7. Kaneko, A.: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. Journal of Combinatorial Theory, Series B, 88, 195–218 (2003)

    Article  MathSciNet  Google Scholar 

  8. Kano, M., Katona, G. Y., Király, Z.: Packing paths of length at least two. Discrete Mathematics, 283, 129–135 (2004)

    Article  MathSciNet  Google Scholar 

  9. Kano, M., Lee, C., Suzuki, K.: Path and cycle factors of cubic bipartite graphs. Discussiones Mathematicae Graph Theory, 28, 551–556 (2008)

    Article  MathSciNet  Google Scholar 

  10. Kano, M., Lu, H., Yu, Q.: Component factors with large components in graphs. Applied Mathematics Letters, 23, 385–389 (2010)

    Article  MathSciNet  Google Scholar 

  11. Kawarabayashi, K., Matsuda, H., Oda, Y., et al.: Path factors in cubic graphs. Journal of Graph Theory, 39, 188–193 (2002)

    Article  MathSciNet  Google Scholar 

  12. Katerinis, P., Woodall, D.: Binding numbers of graphs and the existence of k-factors. The Quarterly Journal of Mathematics Oxford, 38, 221–228 (1987)

    Article  MathSciNet  Google Scholar 

  13. Kelmans A., Packing 3-vertex paths in claw-free graphs and related topics. Discrete Applied Mathematics, 159, 112–127 (2011)

    Article  MathSciNet  Google Scholar 

  14. Matsubara, R., Matsumura, H., Tsugaki, M., et al.: Degree sum conditions for path-factors with specified end vertices in bipartite graphs. Discrete Mathematics, 340, 87–95 (2017)

    Article  MathSciNet  Google Scholar 

  15. Plummer, M., Saito, A.: Toughness, binding number and restricted matching extension in a graph. Discrete Mathematics, 340, 2665–2672 (2017)

    Article  MathSciNet  Google Scholar 

  16. Woodall, D.: The binding number of a graph and its Anderson number. Journal of Combinatorial Theory, Series B, 15, 225–255 (1973)

    Article  MathSciNet  Google Scholar 

  17. Zhang, H., Zhou, S.: Characterizations for P2-factor and P3-factor covered graphs. Discrete Mathematics, 309, 2067–2076 (2009)

    Article  MathSciNet  Google Scholar 

  18. Zhou, S.: A sufficient condition for graphs to be fractional (k, m)-deleted graphs. Applied Mathematics Letters, 24(9), 1533–1538 (2011)

    Article  MathSciNet  Google Scholar 

  19. Zhou, S.: Binding numbers for fractional ID-k-factor-critical graphs. Acta Mathematica Sinica, English Series, 30(1), 181–186 (2014)

    Article  MathSciNet  Google Scholar 

  20. Zhou, S.: Remarks on orthogonal factorizations of digraphs. International Journal of Computer Mathematics, 91(10), 2109–2117 (2014)

    Article  MathSciNet  Google Scholar 

  21. Zhou, S.: Remarks on path factors in graphs. RAIRO-Operations Research, DOI:https://doi.org/10.1051/ro/2019111

  22. Zhou, S.: Some new sufficient conditions for graphs to have fractional k-factors. International Journal of Computer Mathematics, 88(3), 484–490 (2011)

    Article  MathSciNet  Google Scholar 

  23. Zhou, S.: Some results about component factors in graphs. RAIRO-Operations Research, 53(3), 723–730 (2019)

    Article  MathSciNet  Google Scholar 

  24. Zhou, S., Sun, Z., Ye, H.: A toughness condition for fractional (k, m)-deleted graphs. Information Processing Letters, 113(8), 255–259 (2013)

    Article  MathSciNet  Google Scholar 

  25. Zhou, S., Wu, J., Zhang, T.: The existence of P3-factor covered graphs. Discussiones Mathematicae Graph Theory, 37(4), 1055–1065 (2017)

    Article  MathSciNet  Google Scholar 

  26. Zhou, S., Xu, Y., Sun, Z.: Degree conditions for fractional (a, b, k)-critical covered graphs. Information Processing Letters, 152, Article 105838 (2019), DOI: https://doi.org/10.1016/j.ipl.2019.105838

  27. Zhou, S., Yang, F., Xu, L.: Two sufficient conditions for the existence of path factors in graphs. Scientia Iranica, DOI: https://doi.org/10.24200/SCI.2018.5151.1122

Download references

Acknowledgements

The authors would like to thank the anonymous referees for their valuable comments and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Si Zhong Zhou or Zhi Ren Sun.

Additional information

Supported by Six Big Talent Peak of Jiangsu Province (Grant No. JY-022), 333 Project of Jiangsu Province, and the National Natural Science Foundation of China (Grant No. 11371009)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, S.Z., Sun, Z.R. Some Existence Theorems on Path Factors with Given Properties in Graphs. Acta. Math. Sin.-English Ser. 36, 917–928 (2020). https://doi.org/10.1007/s10114-020-9224-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10114-020-9224-5

Keywords

MR(2010) Subject Classification

Navigation