An edge-colored graph $G$ is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph $G$, denoted $rc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow connected. In this paper we prove several non-trivial upper bounds for $rc(G)$, as well as determine sufficient conditions that guarantee $rc(G)=2$. Among our results we prove that if $G$ is a connected graph with $n$ vertices and with minimum degree $3$ then $rc(G) < 5n/6$, and if the minimum degree is $\delta$ then $rc(G) \le {\ln \delta\over\delta}n(1+o_\delta(1))$. We also determine the threshold function for a random graph to have $rc(G)=2$ and make several conjectures concerning the computational complexity of rainbow connection.
Let F = {F1,…} be a given class of forbidden graphs. A graph G is called F‐saturated if no Fi ∈ F is a subgraph of G but the addition of an arbitrary new edge gives a forbidden subgraph. In this paper the minimal number of edges in F‐saturated graphs is examined. General estimations are given and the structure of minimal graphs is described for some special forbidden graphs (stars, paths, m pairwise disjoint edges).
Abstract. The b-chromatic number b(G) of a graph G = (V, E) is the largest integer k such that G admits a vertex partition into k independent sets Xi (i = 1, . . . , k) such that each Xi contains a vertex xi adjacent to at least one vertex of each Xj, j = i. We discuss on the tightness of some bounds on b(G) and on the complexity of determining b(G). We also determine the asymptotic behavior of b(Gn,p) for the random graph, within the accuracy of a multiplicative factor 2 + o(1) as n → ∞.
We survey the literature on those variants of the chromatic number problem where not only a proper coloring has to be found (i.e., adjacent vertices must not receive the same color) but some further local restrictions are imposed on the color assignment. Mostly, the list colorings and the precoloring extensions are considered. In one of the most general formulations, a graph G = (V, E), sets L(v) of admissible colors, and natural numbers c v for the vertices v ∈ V are given, and the question is whether there can be chosen a subset C(v) ⊆ L(v) of cardinality c v for each vertex in such a way that the sets C(v), C(v) are disjoint for each pair v, v of adjacent vertices. The particular case of constant |L(v)| with c v = 1 for all v ∈ V leads to the concept of choice number, a graph parameter showing unexpectedly different behavior compared to the chromatic number, despite these two invariants have nearly the same value for almost all graphs. To illustrate typical techniques, some of the proofs are sketched.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.