Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference29 articles.
1. An algorithmic proof of Tutte’s f-factor theorem;Anstee;J. Algorithms,1985
2. New isolated toughness condition for fractional (g,f,n)-critical graphs;Gao;Colloq. Math.,2017
3. Neighborhood condition for all fractional (g,f,n′,m)-critical deleted graphs;Gao;Open Phys.,2018
4. Kekulé structures of hexagonal chains-some unusual connections;Hosoya;J. Math. Chem.,2008
5. The statistics of dimer on a lattice I: the number of dimer arrangement on a quadratic lattice;Kasteleyn;Physica,1961
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Spanning k-trees and distance signless Laplacian spectral radius of graphs;Discrete Applied Mathematics;2024-12
2. Characterizing spanning trees via the size or the spectral radius of graphs;Aequationes mathematicae;2024-09-04
3. Tight isolated toughness bound for fractional (a,b,m)-deleted graphs;International Journal of Geometric Methods in Modern Physics;2024-08-21
4. Spanning k-trees and distance spectral radius in graphs;The Journal of Supercomputing;2024-07-17
5. On perfect 2-matching uniform graphs;Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science;2024-06-30