Funder
National Science Foundation
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Chordality and 2-factors in tough graphs;Bauer;Discrete Appl. Math.,2000
2. Tough graphs and Hamiltonian circuits;Chvátal;Discrete Math.,1973
3. Toughness and the existence of k-factors;Enomoto;J. Graph Theory,1985
4. Vizing's 2-factor conjecture involving toughness and maximum degree conditions;Kanno;Electron. J. Comb.,2019
5. Hamiltonian cycles in 2-tough 2K2-free graphs;Ota;J. Graph Theory,2022