Author:
Enomoto Hikoe,Jackson Bill,Katerinis P.,Saito Akira
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference5 articles.
1. , and , Graphs & Digraphs. Prindle, Weber & Schmidt, Massachusetts (1979).
2. and , Graph Theory with Applications. Macmillan, London (1976).
3. Tough graphs and hamiltonian circuits
4. Nearly k-tough graphs with no k-factor, unpublished.
5. The Factors of Graphs
Cited by
117 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A spectral condition for a graph to have strong parity factors;Discrete Applied Mathematics;2025-01
2. Toughness and spectral radius in graphs;Discrete Mathematics;2024-12
3. Factors, spectral radius and toughness in bipartite graphs;Discrete Applied Mathematics;2024-10
4. On perfect 2-matching uniform graphs;Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science;2024-06-30
5. Harary index, binding number and toughness of graphs;Kuwait Journal of Science;2024-04