Toughness, degrees and 2-factors

Discrete Mathematics

Volumn 286, Issue 3, 2004, Pages 245-249

  Faudree, Ralph J ^a   Gould, Ronald J ^b   Jacobson, Michael S ^c   Lesniak, Linda ^d   Saito, Akira ^e  

^a UNIVERSITY OF MEMPHIS   (United States)

^b EMORY UNIVERSITY   (United States)

^c UNIVERSITY OF COLORADO   (United States)

^d DREW UNIVERSITY   (United States)

^e NIHON UNIVERSITY   (Japan)

Author keywords

2 Factor; Cycle; Degrees; Hamiltonian; Toughness

Indexed keywords

2-FACTOR; CYCLE; DEGREE; GENERALIZATION;

GRAPH THEORY; HAMILTONIANS; INTEGER PROGRAMMING; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

TOUGHNESS;

EID: 4444260445     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2004.05.008     Document Type: Article

References (6)

1. M. Aigner, S. Brandt, Embedding arbitrary graphs of maximum degree two, J. London Math. Soc. 48 (2) (1993) 39-51.
2. S. Brandt, G. Chen, R.J. Faudree, R.J. Gould, L. Lesniak, On the number of cycles in a 2-factor, J. Graph Theory 24 (2) (1997) 165-173.
3. G. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. 2 (1952) 69-81.
4. G. Chen, R.J. Faudree, R.J. Gould, L. Lesniak, M.S. Jacobson, Cycles in 2-factors of balanced bipartite graphs, Graphs and Combinatorics 16(1) (2000) 67-80.
5. H.A. Jung, On maximal circuits in finite graphs, Ann. Discrete Math. 3 (1978) 129-144.
6. N. Sauer, J. Spencer, Edge disjoint placements of graphs, J. Combin. Theory B 25 (1978) 295-302.