نتایج جستجو برای: graph coloring
تعداد نتایج: 201742 فیلتر نتایج به سال:
Abstract We present a polynomial-space algorithm that computes the number of independent sets any input graph in time $$O(1.1389^n)$$ O ( 1 . 1389 n ) for graphs ...
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex problem on unit-disk graphs. The related problem of minimum co-k-plex coloring that generalizes classical vertex coloring is also studied in the context of unit-disk graphs. We extend several classical approximation results...
All graph in this paper be a connected and simple graph. Let c:V(G)→{1,2,…,k} is proper vertex coloring where k ≥ 2 which induces edge c':E(G)→{1,2,…,k} define by c' (uv)=|c(u)-c(v)|, uv E(G) called graceful k-coloring. A c of G if k-coloring for some k∈ N. The minimum chromatic number denoted χ_g (G). In paper, we will investigate the establish exact value on grid family namely H 〖(H〗_n) n≥2 m...
We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used more than b times. We say that a subset of the edges of G is rainbow if each edge is of a different color. A graph has property A(b, H) if every b-bounded coloring of its edges has a rainbow copy of H. We estimate the threshold for the random graph Gn,p to have property A(b, H).
A 2-distance coloring of a graph is a coloring of the vertices such that two vertices at distance at most 2 receive distinct colors. We prove that every graph with maximum degree Δ at least 4 and maximum average degree less that 73 admits a 2-distance (Δ + 1)-coloring. This result is tight. This improves previous known results of Dolama and Sopena.
A 2-hued coloring of a graph G (also known as conditional (k, 2)-coloring and dynamic coloring) is a coloring such that for every vertex v ∈ V (G) of degree at least 2, the neighbors of v receive at least 2 colors. The smallest integer k such that G has a 2-hued coloring with k colors, is called the 2-hued chromatic number of G and denoted by χ2(G). In this paper, we will show that if G is a re...
A strong edge coloring of a graph is a proper edge coloring in which every color class is an induced matching. The strong chromatic index χspGq of a graph G is the minimum number of colors in a strong edge coloring of G. Let ∆ ě 4 be an integer. In this note, we study the properties of the odd graphs, and show that every planar graph with maximum degree at most ∆ and girth at least 10∆ ́ 4 has a...
In this paper we study the planar graphs that admit an acyclic 3-coloring. We show that testing acyclic 3-colorability is NP-hard, even for planar graphs of maximum degree 4, and we show that there exist infinite classes of cubic planar graphs that are not acyclically 3-colorable. Further, we show that every planar graph has a subdivision with one vertex per edge that admits an acyclic 3-colori...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید