On r
-
Add time:08/03/2019 Source:sciencedirect.com
For integers k,r>0, a (k,r)-coloring of a graph G is a proper coloring on the vertices of G with k colors such that every vertex v of degree d(v) is adjacent to vertices with at least min{d(v),r} different colors. The r-hued chromatic number, denoted by χr(G), is the smallest integer k for which a graph G has a (k,r)-coloring. We prove the following:(i) If G is a P4-free graph, then χr(G)≤χ(G)+2(r−1), and this bound is best possible.(ii) If G is a P5-free bipartite graph, then χr(G)≤rχ(G), and this bound is best possible.(iii) If G is a P5-free graph, then χ2(G)≤2χ(G), and this bound is best possible.
We also recommend Trading Suppliers and Manufacturers of (R)-(+)-alpha-Amino-gamma-butyrolactone hydrochloride (cas 104347-13-9). Pls Click Website Link as below: cas 104347-13-9 suppliers
Prev:Application of HPLC to assess the compatibility of Bisoprolol fumarate (cas 104344-23-2) with selected excipients in mixtures by isothermal stress testing
Next:New combinatorial interpretations of r) - 【Back】【Close 】【Print】【Add to favorite 】
- Related Information
- New combinatorial interpretations of r08/04/2019
-
Health and Chemical more >