Vertex partitions by connected monochromatic k-regular graphs

被引：12
|
作者：
Sárközy, GN [1 ]
Selkow, SM [1 ]
机构：
[1] Worcester Polytech Inst, Dept Comp Sci, Worcester, MA 01609 USA
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 2000年 / 78卷 / 01期
关键词：
D O I：
10.1006/jctb.1999.1933
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Generalizing a result of Erdos. Gyarfas and Pyber we show that there exists a constant c such that for any integers k greater than or equal to 2 and for any coloring of the edges of a complete graph with, colors, its vertices can be partitioned into at most r(c(r log r + k)) connected monochromatic k-regular subgraphs and vertices. We also show that the same result holds for complete bipartite graphs, generalizing a result of Haxell. (C) 2000 Academic Press.
引用
收藏
页码：115 / 122
页数：8
相关论文
共 50 条
  • [1] An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
    Sarkoezy, Gabor N.
    Selkow, Stanley M.
    Song, Fei
    [J]. JOURNAL OF GRAPH THEORY, 2013, 73 (02) : 127 - 145
  • [2] Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs
    Sarkoezy, Gabor N.
    Selkow, Stanley M.
    Song, Fei
    [J]. DISCRETE MATHEMATICS, 2011, 311 (18-19) : 2079 - 2084
  • [3] The connected vertex cover problem in k-regular graphs
    Li, Yuchao
    Wang, Wei
    Yang, Zishen
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (02) : 635 - 645
  • [4] The connected vertex cover problem in k-regular graphs
    Yuchao Li
    Wei Wang
    Zishen Yang
    [J]. Journal of Combinatorial Optimization, 2019, 38 : 635 - 645
  • [5] ON THE K-DIAMETER OF K-REGULAR K-CONNECTED GRAPHS
    HSU, DF
    LUCZAK, T
    [J]. DISCRETE MATHEMATICS, 1994, 133 (1-3) : 291 - 296
  • [6] On generalized k-diameter of k-regular k-connected graphs
    Hou, XM
    Wang, TM
    [J]. TAIWANESE JOURNAL OF MATHEMATICS, 2004, 8 (04): : 739 - 745
  • [7] A polynomial algorithm determining cyclic vertex connectivity of k-regular graphs with fixed k
    Jun Liang
    Dingjun Lou
    [J]. Journal of Combinatorial Optimization, 2019, 37 : 1000 - 1010
  • [8] Circuits through prescribed vertices in k-connected k-regular graphs
    Häggkvist, R
    Mader, W
    [J]. JOURNAL OF GRAPH THEORY, 2002, 39 (02) : 145 - 163
  • [9] A polynomial algorithm determining cyclic vertex connectivity of k-regular graphs with fixed k
    Liang, Jun
    Lou, Dingjun
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (03) : 1000 - 1010
  • [10] EMBEDDING K-REGULAR GRAPHS IN K+1-REGULAR GRAPHS
    GARDINER, A
    [J]. JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1983, 28 (DEC): : 393 - 400
12345