دورية أكاديمية
2-frugal Coloring of Planar Graphs with Maximum Degree at Most 6.
| العنوان: | 2-frugal Coloring of Planar Graphs with Maximum Degree at Most 6. |
|---|---|
| المؤلفون: | Xiaoyuan Lou, Lei Sun, Wei Zheng |
| المصدر: | IAENG International Journal of Computer Science; Mar2023, Vol. 50 Issue 1, p342-346, 5p |
| مصطلحات موضوعية: | GRAPH coloring, PLANAR graphs, TRIANGLES, COLORS |
| مستخلص: | For a color c in a proper coloring of a graph G, let nc(v) denote the times of the color c be used in the neighbors N(v) of the vertex v. A t-frugal k-coloring of G is a proper coloring f: V (G) - {1, 2, . . ., k} such that every vertex v - V (G) has nc(v) = t for each color c. The minimum number of colors required to ensure that a graph G has a t-frugal coloring is called t-frugal chromatic number of G, denoted by Ft(G). This paper proved that if G is a planar graph with -(G) = 6, then F2(G) = 17. We also gave a linear time algorithm for producing a 2-frugal 17-coloring of a planar graph G without adjacent triangles. [ABSTRACT FROM AUTHOR] |
| Copyright of IAENG International Journal of Computer Science is the property of Newswood Limited and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| قاعدة البيانات: | Supplemental Index |
كن أول من يترك تعليقا!