Vertex Coloring of a Graph for Memory Constrained Scenarios
Sign Up to like & getrecommendations! Published in 2020 at "Mathematics in Computer Science"
DOI: 10.1007/s11786-019-00409-4
Abstract: Given an undirected graph $$G=(V,E)$$ G = ( V , E ) , where V is a set of n vertices and E is a set of m edges, the vertex coloring problem consists in… read more here.
Keywords: constrained scenarios; graph memory; coloring graph; vertex coloring ... See more keywords
Star coloring under some graph operations
Sign Up to like & getrecommendations! Published in 2021 at "Asian-European Journal of Mathematics"
DOI: 10.1142/s1793557122500796
Abstract: A star coloring of a graph [Formula: see text] is a proper coloring of [Formula: see text] such that no path of length 3 in [Formula: see text] is bicolored. In this paper, the star… read more here.
Keywords: coloring graph; see text; formula see; star coloring ... See more keywords