Premium
Toughness, minimum degree, and the existence of 2‐factors
Author(s) -
Bauer D.,
Schmeichel E.
Publication year - 1994
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190180304
Subject(s) - mathematics , degree (music) , combinatorics , graph , toughness , discrete mathematics , physics , metallurgy , materials science , acoustics
Degree conditions on the vertices of a t ‐tough graph G (1 ≦ t ≦ 2) that ensure the existence of a 2‐factor in G are presented. These conditions are asymptotically best possible for every t ϵ [1, 3/2] and for infinitely many t ϵ [3/2, 2].
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom