Premium
Toughness, minimum degree, and spanning cubic subgraphs
Author(s) -
Bauer D.,
Niessen T.,
Schmeichel E.
Publication year - 2004
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.20033
Subject(s) - library science , combinatorics , citation , mathematics , computer science , operations research
Degree conditions on the vertices of a t-tough graph G (1 t < 3) are presented which ensure the existence of a spanning cubic subgraph in G. These conditions are best possible to within a small additive constant for every fixed rational t2 [1,4=3) [ [2,8=3). 2003 Wiley Periodicals, Inc. J Graph Theory 45: 119–141, 2004
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