Downloads provided by UsageCounts
handle: 20.500.14299/74949
Graphs and Algorithms The split-coloring problem is a generalized vertex coloring problem where we partition the vertices into a minimum number of split graphs. In this paper, we study some notions which are extensively studied for the usual vertex coloring and the cocoloring problem from the point of view of split-coloring, such as criticality and the uniqueness of the minimum split-coloring. We discuss some properties of split-critical and uniquely split-colorable graphs. We describe constructions of such graphs with some additional properties. We also study the effect of the addition and the removal of some edge sets on the value of the split-chromatic number. All these results are compared with their cochromatic counterparts. We conclude with several research directions on the topic.
split-coloring, 511, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 004, Theoretical Computer Science, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Cliques, Principes généraux des mathématiques, split-critical, info:eu-repo/classification/udc/004, uniquely split-colorable, QA1-939, Discrete Mathematics and Combinatorics, split-decreasing, Split-coloring, Mathematics
split-coloring, 511, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 004, Theoretical Computer Science, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Cliques, Principes généraux des mathématiques, split-critical, info:eu-repo/classification/udc/004, uniquely split-colorable, QA1-939, Discrete Mathematics and Combinatorics, split-decreasing, Split-coloring, Mathematics
| citations The total number of citations received by all articles of the researcher of interest. | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 109 | |
| downloads | 102 |

Views provided by UsageCounts
Downloads provided by UsageCounts