AbstractA proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color classes differ by at most 1. A graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable and each color appears on at most ⌈∣V(G)∣k⌉ vertices. We prove in this paper that outerplane graphs are equitably k-choosable whenever k≥Δ, where Δ is the maximum degree. Moreover, we discuss equitable colorings of some d-degenerate graphs
AbstractA graph G is equitably k-choosable if for any k-uniform list assignment L, there exists an L...
AbstractConsider a graph G consisting of a vertex set V(G) and an edge set E(G). Let Δ(G) and χ(G) d...
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
AbstractA proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color c...
A graph is said to be equitably k-colorable if the vertex set V (G) can be partitioned into k indepe...
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equit...
AbstractA graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
A graph G is equitably k-choosable if for any k-uniform list assignment L, G is L-colorable and each...
AbstractA graph G is equitably k-choosable if for any k-uniform list assignment L, there exists an L...
AbstractA graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
AbstractIn this paper, we prove that every series–parallel graph with maximum degree Δ is equitably ...
AbstractIn this paper, we prove that every series–parallel graph with maximum degree Δ is equitably ...
AbstractAn equitable coloring of a graph is a proper vertex coloring such that the sizes of any two ...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
In this thesis we study list coloring which was introduced independently by Vizing and Erd˝os, Rubin...
AbstractA graph G is equitably k-choosable if for any k-uniform list assignment L, there exists an L...
AbstractConsider a graph G consisting of a vertex set V(G) and an edge set E(G). Let Δ(G) and χ(G) d...
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
AbstractA proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color c...
A graph is said to be equitably k-colorable if the vertex set V (G) can be partitioned into k indepe...
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equit...
AbstractA graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
A graph G is equitably k-choosable if for any k-uniform list assignment L, G is L-colorable and each...
AbstractA graph G is equitably k-choosable if for any k-uniform list assignment L, there exists an L...
AbstractA graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
AbstractIn this paper, we prove that every series–parallel graph with maximum degree Δ is equitably ...
AbstractIn this paper, we prove that every series–parallel graph with maximum degree Δ is equitably ...
AbstractAn equitable coloring of a graph is a proper vertex coloring such that the sizes of any two ...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
In this thesis we study list coloring which was introduced independently by Vizing and Erd˝os, Rubin...
AbstractA graph G is equitably k-choosable if for any k-uniform list assignment L, there exists an L...
AbstractConsider a graph G consisting of a vertex set V(G) and an edge set E(G). Let Δ(G) and χ(G) d...
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
DOI
Add to ORKG