Premium
Partial Degree Conditions and Cycle Coverings
Author(s) -
Wang Hong
Publication year - 2015
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.21807
Subject(s) - combinatorics , mathematics , vertex (graph theory) , disjoint sets , degree (music) , graph , integer (computer science) , order (exchange) , discrete mathematics , computer science , physics , finance , acoustics , economics , programming language
Let G be a graph of order n . Let W be a subset of V ( G ) with | W | ≥ 3 k , where k is a positive integer. We show that if d ( x ) ≥ 2 n / 3 for each x ∈ W , then G contains k vertex‐disjoint cycles covering W such that each of the k cycles contains at least three vertices of W .
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