Maximum Colored Cuts in Edge-Colored Complete Graphs

被引：0
|
作者：
Ma, Huawen [1 ]
机构：
[1] Yanan Univ, Coll Math & Comp Sci, Yanan 716000, Shaanxi, Peoples R China
来源：
JOURNAL OF MATHEMATICS | 2022年 / 2022卷
关键词：
ALTERNATING CYCLES;
D O I：
10.1155/2022/9515498
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Max-Cut problem is one of the classical problems in graph theory and has been widely studied in recent years. Maximum colored cut problem is a more general problem, which is to find a bipartition of a given edge-colored graph maximizing the number of colors in edges going across the bipartition. In this work, we gave some lower bounds on maximum colored cuts in edge-colored complete graphs containing no rainbow triangles or properly colored 4-cycles.
引用
收藏
页数：4
相关论文
共 50 条
  • [1] Maximum cuts in edge-colored graphs
    Faria, Luerbio
    Klein, Sulamita
    Sau, Ignasi
    Souza, Ueverton S.
    Sucupira, Rubens
    [J]. DISCRETE APPLIED MATHEMATICS, 2020, 281 : 229 - 234
  • [2] Maximum cuts in edge-colored graphs
    Faria, Luerbio
    Klein, Sulamita
    Sau, Ignasi
    Souza, Uéverton S.
    Sucupira, Rubens
    [J]. Discrete Applied Mathematics, 2021, 281 : 229 - 234
  • [3] Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
    Li, Ruonan
    Broersma, Hajo
    Zhang, Shenggui
    [J]. GRAPHS AND COMBINATORICS, 2019, 35 (01) : 261 - 286
  • [4] Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
    Ruonan Li
    Hajo Broersma
    Shenggui Zhang
    [J]. Graphs and Combinatorics, 2019, 35 : 261 - 286
  • [5] Maximum colored trees in edge-colored graphs
    Borozan, V.
    de la Vega, W. Fernandez
    Manoussakis, Y.
    Martinhon, C.
    Muthu, R.
    Pham, H. P.
    Saad, R.
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2019, 80 : 296 - 310
  • [6] Maximum properly colored trees in edge-colored graphs
    Jie Hu
    Hao Li
    Shun-ichi Maezawa
    [J]. Journal of Combinatorial Optimization, 2022, 44 : 154 - 171
  • [7] Maximum properly colored trees in edge-colored graphs
    Hu, Jie
    Li, Hao
    Maezawa, Shun-ichi
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (01) : 154 - 171
  • [8] Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
    Nils Morawietz
    Niels Grüttemeier
    Christian Komusiewicz
    Frank Sommer
    [J]. Theory of Computing Systems, 2022, 66 : 1019 - 1045
  • [9] Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
    Morawietz, Nils
    Gruettemeier, Niels
    Komusiewicz, Christian
    Sommer, Frank
    [J]. THEORY OF COMPUTING SYSTEMS, 2022, 66 (05) : 1019 - 1045
  • [10] Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
    Morawietz, Nils
    Gruettemeier, Niels
    Komusiewicz, Christian
    Sommer, Frank
    [J]. SOFSEM 2020: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2020, 12011 : 248 - 259
12345