Abstract
A graph G consists of a non-null set V of objects called vertices together with a set E of objects called edges, the two sets having no common element. With each edge there are associated just two vertices, called its ends. Two or more edges may have the same pair of ends.
Publisher
Canadian Mathematical Society
Cited by
305 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Some results on {K2,C2i+1:i≥1}-factor in a graph;Discrete Applied Mathematics;2025-01
2. Spectral conditions for graphs having all (fractional) [a,b]-factors;Discrete Mathematics;2024-07
3. On graph-based network parameters and component factors in networks;RAIRO - Operations Research;2024-07
4. On perfect 2-matching uniform graphs;Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science;2024-06-30
5. A Degree Condition for Graphs Having All (a, b)-parity Factors;Acta Mathematicae Applicatae Sinica, English Series;2024-06-05