Toughness, Minimum Degree, and Spanning Cubic Subgraphs

Journal of Graph Theory

Volumn 45, Issue 2, 2004, Pages 119-141

  Bauer, D ^a   Niessen, T ^b   Schmeichel, E ^c  

^a Stevens Institute of Technology   (United States)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c SAN JOSE STATE UNIVERSITY   (United States)

Author keywords

3 factors; Minimum vertex degree; Toughness

Indexed keywords

GRAPHIC METHODS; HAMILTONIANS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; TOUGHNESS;

3-FACTORS; MINIMUM VERTEX DEGREE; SPANNING CUBIC SUBGRAPHS;

GRAPH THEORY;

EID: 0742269793     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.10149     Document Type: Article

References (8)

1. D. Bauer, H. J. Broersma, and H. J. Veldman, Not every 2-tough graph is hamiltonian, Discrete Appl Math 99 (2000), 317-321.
2. D. Bauer, T. Niessen, and E. Schmeichel, Neighborhood unions, degree sums, toughness, and 2-factors, Congress Numer 100 (1994), 47-57.
3. D. Bauer and E. Schmeichel, Toughness, minimum degree and the existence of 2-factors, J Graph Theory 18 (1994), 241-256.
4. H.-B. Belck, Reguläe Faktoren von Graphen, J Reine Angew Math 188 (1950), 228-252.
5. G. Chartrand and L. Lesniak, Graphs and Digraphs, Wadsworth, Inc., Belmont, CA, 1986.
6. V. Chváal, Tough graphs and hamiltonian circuits, J Combinat Theory-Ser B 5 (1973), 215-228.
7. H. Enomoto, B. Jackson, P. Katerinis, and A. Saito, Toughness and the existence of k-Factors, J Graph Theory 9 (1985), 87-95.
8. W. T. Tutte, The factors of graphs, Canad J Math 4 (1952), 314-328.