Approximations for λ-Colorings of Graphs
نویسندگان
چکیده
A λ-coloring of a graph G is an assignment of colors from the integer set {0, . . . , λ} to the vertices of the graph G such that vertices at distance of at most two get different colors and adjacent vertices get colors which are at least two apart. The problem of finding λ-colorings with optimal or near-optimal λ arises in the context of radio frequency assignment. We show that the problem of finding the minimum λ for planar graphs, bipartite graphs, chordal graphs and split graphs is NP-complete. We also give approximation algorithms forλ-coloring and compute upper bounds on the best possible λ for outerplanar graphs, graphs of treewidth k, permutation and split graphs. Except in the case of split graphs, all the above bounds for λ are linear in , the maximum degree of the graph. For split graphs, we give a bound of 1 2 1.5 + 2 and we show that there are split graphs G with λ(G) = ( 1.5). Similar results are also given for variations of the λ-coloring problem.
منابع مشابه
Perfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملThe λ-backbone colorings of graphs with tree backbones
The λ-backbone coloring is one of the various problems of vertex colorings in graphs. Given an integer λ ≥ 2, a graph G = (V,E), and a spanning subgraph (backbone) H = (V, EH) of G, a λ-backbone coloring of (G,H) is a proper vertex coloring V → {1, 2, ...} of G in which the colors assigned to adjacent vertices in H differ by at least λ. The λ-backbone coloring number BBCλ(G,H) of (G,H) is the s...
متن کاملThe maximum number of colorings of graphs of given order and size
The set of all simple graphs on n vertices and m edges f (n, m, λ) The maximum number of coloring of a graph with n vertices and m edges in at most λ colors (n, m)-graph A graph of order n and size m i 1 The maximum number of colorings of graphs of given order and size Below is the plan of this chapter. 1 2 The maximum number of colorings of graphs of given order and size • Definitions and nota...
متن کاملMaximum number of colorings of (2k, k2)-graphs
Let F2k,k2 consist of all simple graphs on 2k vertices and k2 edges. For a simple graph G and a positive integer λ, let PG(λ) denote the number of proper vertex colorings of G in at most λ colors, and let f(2k, k2, λ) = max{PG(λ) : G ∈ F2k,k2}. We prove that f(2k, k2, 3) = PKk,k(3) and Kk,k is the only extremal graph. We also prove that f(2k, k2, 4) = (6 + o(1))4k as k →∞.
متن کاملBackbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
We continue the study on backbone colorings, a variation on classical vertex colorings that was introduced at WG2003. Given a graph G = (V,E) and a spanning subgraph H of G (the backbone of G), a λ-backbone coloring for G and H is a proper vertex coloring V → {1, 2, . . .} of G in which the colors assigned to adjacent vertices in H differ by at least λ. The algorithmic and combinatorial propert...
متن کامل