Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference17 articles.
1. Perfect matchings of a graph;Anderson;J. Combinatorial Theory Ser. B,1971
2. Sufficient conditions for matchings;Anderson,1972
3. Sur le couplage maximum d'un graphe;Berge;C. R. Acad. Sci. Paris,1958
4. V. Chvátal, Tough graphs and Hamiltonian circuits, Discrete Mathematics (to appear).
5. Extremal problems in graph theory;Erdös,1967
Cited by
174 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Some results on vulnerability parameters and Wiener-type indices;Discrete Applied Mathematics;2024-12
2. Binding Number Bounds of Zero Divisor Graphs of Classes of Completely Primary Finite Rings;African Scientific Annual Review;2024-08-07
3. On perfect 2-matching uniform graphs;Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science;2024-06-30
4. Dynamics of cycles in polyhedra I: The isolation lemma;Journal of Combinatorial Theory, Series B;2024-05
5. Harary index, binding number and toughness of graphs;Kuwait Journal of Science;2024-04