Paper Info
Title
A 2-Factor In Which Each Cycle Contains A Vertex In A Specified Stable Set
Abstract
Let G be a graph with order n, and let k be an integer with 1 <= k <= n/3. In this article, we show that if sigma(2)(G) >= n+ k - 1, then for any stable set S subset of V (G) with |S| = k, there exists a 2-factor with precisely k cycles C-1,...,C-k such that |V(C-i) boolean AND S| = 1 for all 1 <= i <= k and at most one of the cycles C-i has length strictly greater than three. The lower bound on sigma(2) is best possible.
Year
Venue
Field
2010
AUSTRALASIAN JOURNAL OF COMBINATORICS
Integer,Graph,Combinatorics,Bound graph,Vertex (geometry),Upper and lower bounds,Independent set,Mathematics
DocType
Volume
ISSN
Journal
46
2202-3518
Citations 
PageRank 
References 
2
0.39
6
Authors
3
Name
Order
Citations
PageRank
Shuya Chiba13512.93
Yoshimi Egawa22410.00
Kiyoshi Yoshimoto313322.65