[a, b]-Factors With Given Edges In Graphs

被引：0

作者：

Zhou, Sizhong ^{[1
]}

机构：

[1] Jiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R China

来源：

ARS COMBINATORIA | 2014年 / 114卷

关键词：

graph; subgraph; minimum degree; a; b]-factor; INDEPENDENT SETS; NEIGHBORHOODS;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a graph, and let a and b be integers with 1 <= a <= b. An [a, b]-factor of G is defined as a spanning subgraph F of G such that a <= d(F)(x) <= b for each x epsilon V(C). In this paper, we obtain a sufficient condition for a graph to have [a, b]-factors including given edges that extends a well-known sufficient condition for the existence of a k-factor.

引用

页码：267 / 272

页数：6

共 50 条

[31] Degree conditions for Hamiltonian graphs to have [a,b]-factors containing a given Hamiltonian cycle
Matsuda, H
DISCRETE MATHEMATICS, 2004, 280 (1-3) : 241 - 250
[32] EDGE-CONNECTIVITY AND EDGES OF EVEN FACTORS OF GRAPHS
Haghparast, Nastaran
Kiani, Dariush
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2019, 39 (02) : 357 - 364
[33] Characterization of graphs with a given number of additional edges in a minimal 1-vertex extension
Abrosimov, M. B.
PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2012, 15 (01): : 111 - 120
[34] The Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges
Hong, Zhen-Mu
Fan, Yi-Zheng
GRAPHS AND COMBINATORICS, 2015, 31 (05) : 1473 - 1485
[35] Maximizing and Minimizing Multiplicative Zagreb Indices of Graphs Subject to Given Number of Cut Edges
Wang, Shaohui
Wang, Chunxiang
Chen, Lin
Liu, Jia-Bao
Shao, Zehui
MATHEMATICS, 2018, 6 (11):
[36] The Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges
Zhen-Mu Hong
Yi-Zheng Fan
Graphs and Combinatorics, 2015, 31 : 1473 - 1485
[37] A sharp upper bound for the number of stable sets in graphs with given number of cut edges
Hua, Hongbo
APPLIED MATHEMATICS LETTERS, 2009, 22 (09) : 1380 - 1385
[38] [A,B]-FACTORS OF GRAPHS
KANO, M
SAITO, A
DISCRETE MATHEMATICS, 1983, 47 (01) : 113 - 116
[39] Toughness of graphs and 2-factors with given properties
Katerinis, P.
Wang, Tao
ARS COMBINATORIA, 2010, 95 : 161 - 177
[40] TOUGHNESS OF GRAPHS AND K-FACTORS WITH GIVEN PROPERTIES
CHEN, CP
ARS COMBINATORIA, 1992, 34 : 55 - 64

← 1 2 3 4 5 →