Premium
Binding number and minimum degree for k‐factors
Author(s) -
Tokushige Norihide
Publication year - 1989
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.3190130511
Subject(s) - combinatorics , mathematics , degree (music) , graph , order (exchange) , discrete mathematics , physics , finance , acoustics , economics
In this paper, we study mixed conditions on the binding number and the minimum degree of a graph G that guarantee the existence of a k ‐factor in G . Among others, we prove that a graph G of order n with δ (G) ⩾ cn and bind (G) > (2 − 3 c )/(1 − c ), where c is any fixed number, has a 2‐factor.
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