Open Access
| Issue |
RAIRO-Oper. Res.
Volume 56, Number 4, July-August 2022
|
|
|---|---|---|
| Page(s) | 2895 - 2901 | |
| DOI | https://doi.org/10.1051/ro/2022112 | |
| Published online | 24 August 2022 | |
- J. Akiyama and M. Kano, Factors and factorizations of graphs – a survey. J. Graph Theory 9 (1985) 1–42. [Google Scholar]
- J. Akiyama, D. Avis and H. Era, On a {1,2}-factor of a graph. TRU Math. 16 (1980) 97–102. [Google Scholar]
- K. Ando, Y. Egawa, A. Kaneko, K.I. Kawarabayashi and H. Matsuda, Path factors in claw-free graphs. Discrete Math. 243 (2002) 195–200. [CrossRef] [MathSciNet] [Google Scholar]
- J.A. Bondy and U.S.R. Murty, Graph Theory with Applications. North-Holland, New York-Amsterdam-Oxford (1982). [Google Scholar]
- V. Chvátal, Tough graphs and Hamiltonian circuits. Discrete Math. 5 (1973) 215–228. [CrossRef] [MathSciNet] [Google Scholar]
- G. Dai, The existence of path-factor covered graphs. Discuss. Math. Graph Theory (2020). DOI: 10.7151/dmgt.2353. [Google Scholar]
- G. Dai, Remarks on component factors in graphs. RAIRO: Oper. Res. 56 (2022) 721–730. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
- G. Dai and Z. Hu, P3-factors in the square of a tree. Graphs Comb. 36 (2020) 1913–1925. [CrossRef] [Google Scholar]
- G. Dai, Z. Zhang, Y. Hang and X. Zhang, Some degree conditions for P≥3-factor covered graphs. RAIRO: Oper. Res. 55 (2021) 2907–2913. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
- Y. Egawa and M. Furuya, The existence of a path-factor without small odd paths. Electron. J. Comb. 25 (2018) 1–40. [Google Scholar]
- Y. Egawa and M. Furuya, Path-factors involving paths of order seven and nine. Theory App. Graphs 3 (2016). DOI: 10.20429/tag.2016.030105. [Google Scholar]
- Y. Egawa, M. Furuya and K. Ozeki, Sufficient conditions for the existence of a path-factor which are related to odd components. J. Graph Theory 89 (2018) 327–340. [CrossRef] [MathSciNet] [Google Scholar]
- A. Kaneko, 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. Comb. Theory Ser. B 88 (2003) 195–218. [Google Scholar]
- A. Kaneko, A. Kelmans and T. Nishimura, On packing 3-vertex paths in a graph. J. Graph Theory 36 (2001) 175–197. [CrossRef] [MathSciNet] [Google Scholar]
- M. Kano, G.Y. Katona and Z. Király, Packing paths of length at least two. Discrete Math. 283 (2004) 129–135. [Google Scholar]
- M. Kano, C. Lee and K. Suzuki, Path and cycle factors of cubic bipartite graphs. Discuss. Math. Graph Theory 28 (2008) 551–556. [Google Scholar]
- K. Kawarabayashi, H. Matsuda, Y. Oda and K. Ota, Path factors in cubic graphs. J. Graph Theory 39 (2002) 188–193. [Google Scholar]
- M. Loebl and S. Poljak, Efficient subgraph packing. J. Comb. Theory Ser. B 59 (1993) 106–121. [CrossRef] [Google Scholar]
- M.D. Plummer, Perspectives: graph factors and factorization: 1985–2003: a survey. Discrete Math. 307 (2007) 791–821. [CrossRef] [MathSciNet] [Google Scholar]
- W.T. Tutte, The factors of graphs. Can. J. Math. 4 (1952) 314–328. [CrossRef] [Google Scholar]
- D.R. Woodall, The binding number of a graph and its Anderson number. J. Comb. Theory Ser. B 15 (1973) 225–255. [CrossRef] [Google Scholar]
- Q.R. Yu and G.Z. Liu, Graph Factors and Matching Extensions. Higher Education Press, Beijing (2009). [Google Scholar]
- P. Zhang and S. Zhou, Characterizations for P≥2-factor and P≥3-factor covered graphs. Discrete Math. 309 (2009) 2067–2076. [CrossRef] [MathSciNet] [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.