Maximum Colored Cuts in Edge-Colored Complete Graphs
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/9515498 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832549013162819584 |
|---|---|
| author | Huawen Ma |
| author_facet | Huawen Ma |
| author_sort | Huawen Ma |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-2a1472b3ddfa489ca4987d4c4457e9e4 |
| institution | Kabale University |
| issn | 2314-4785 |
| language | English |
| publishDate | 2022-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Mathematics |
| spelling | doaj-art-2a1472b3ddfa489ca4987d4c4457e9e42025-02-03T06:12:25ZengWileyJournal of Mathematics2314-47852022-01-01202210.1155/2022/9515498Maximum Colored Cuts in Edge-Colored Complete GraphsHuawen Ma0College of Mathematics and Computer ScienceMax-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.http://dx.doi.org/10.1155/2022/9515498 |
| spellingShingle | Huawen Ma Maximum Colored Cuts in Edge-Colored Complete Graphs Journal of Mathematics |
| title | Maximum Colored Cuts in Edge-Colored Complete Graphs |
| title_full | Maximum Colored Cuts in Edge-Colored Complete Graphs |
| title_fullStr | Maximum Colored Cuts in Edge-Colored Complete Graphs |
| title_full_unstemmed | Maximum Colored Cuts in Edge-Colored Complete Graphs |
| title_short | Maximum Colored Cuts in Edge-Colored Complete Graphs |
| title_sort | maximum colored cuts in edge colored complete graphs |
| url | http://dx.doi.org/10.1155/2022/9515498 |
| work_keys_str_mv | AT huawenma maximumcoloredcutsinedgecoloredcompletegraphs |