Add to ORKGA proper vertex coloring of a graphG is called a star-coloring if there is no path on four vertices assigned to two colors. The graph G is L-star-colorable if for a given list assignment L there is a star-coloring c such that c(v) ∈ L(v). If G is L-star-colorable for any list assignment L with |L(v) | ≥ k for all v ∈ V (G), then G is called k-star-choosable. The star list chromatic number of G, denoted by χls(G), is the smallest integer k such that G is k-star-choosable. In this article, we prove that every graph G with maximum average degree less than 3 is 8-star-choosable. This extends a result that planar graphs of girth at least 6 are 8-star-choosable [A. Kündgen, C. Timmons, Star coloring planar graphs from small lists, J. Graph The...
AbstractA graph G is m-choosable with impropriety d, or simply (m,d)∗-choosable, if for every list a...
It is known that if G is a graph that can be drawn without edges crossing in a surface with Euler ch...
International audienceA star coloring of an undirected graph G is a proper vertex coloring of G (i.e...
The focus of this thesis is star coloring planar graphs. A star coloring of a planar graph is a prop...
A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique contained ...
The star chromatic index of a multigraph G, denoted χ′s(G), is the minimum number of colors needed t...
A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique contained ...
A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique contained ...
AbstractA graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which...
AbstractA graph G = G(V, E) with lists L(v), associated with its vertices v ∈ V, is called L-list co...
AbstractA graph G=G(V,E) is called L-list colourable if there is a vertex colouring of G in which th...
A star edge-coloring of a graph G is a proper edge coloring such that every 2-colored connected subg...
A graph G is called (k, d)∗-choosable if, for every list assignment L satisfying |L(v) | = k for al...
AbstractA graph G is equitably k-choosable if for any k-uniform list assignment L, there exists an L...
60 pages, 61 figuresTotal coloring is a variant of edge coloring where both vertices and edges are t...
AbstractA graph G is m-choosable with impropriety d, or simply (m,d)∗-choosable, if for every list a...
It is known that if G is a graph that can be drawn without edges crossing in a surface with Euler ch...
International audienceA star coloring of an undirected graph G is a proper vertex coloring of G (i.e...
The focus of this thesis is star coloring planar graphs. A star coloring of a planar graph is a prop...
A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique contained ...
The star chromatic index of a multigraph G, denoted χ′s(G), is the minimum number of colors needed t...
A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique contained ...
A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique contained ...
AbstractA graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which...
AbstractA graph G = G(V, E) with lists L(v), associated with its vertices v ∈ V, is called L-list co...
AbstractA graph G=G(V,E) is called L-list colourable if there is a vertex colouring of G in which th...
A star edge-coloring of a graph G is a proper edge coloring such that every 2-colored connected subg...
A graph G is called (k, d)∗-choosable if, for every list assignment L satisfying |L(v) | = k for al...
AbstractA graph G is equitably k-choosable if for any k-uniform list assignment L, there exists an L...
60 pages, 61 figuresTotal coloring is a variant of edge coloring where both vertices and edges are t...
AbstractA graph G is m-choosable with impropriety d, or simply (m,d)∗-choosable, if for every list a...
It is known that if G is a graph that can be drawn without edges crossing in a surface with Euler ch...
International audienceA star coloring of an undirected graph G is a proper vertex coloring of G (i.e...