Results 1 to 10 of about 11,332 (129)
Parameterized Complexity of Equitable Coloring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A graph on $n$ vertices is equitably $k$-colorable if it is $k$-colorable and every color is used either $\left\lfloor n/k \right\rfloor$ or $\left\lceil n/k \right\rceil$ times.
Guilherme de C. M. Gomes +2 more
doaj +6 more sources
Equitable Colorings Of Corona Multiproducts Of Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2017 A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the numbers of vertices in any two sets differ by at most one.
Furmánczyk Hanna +2 more
doaj +3 more sources
Equitable Coloring and Equitable Choosability of Graphs with Small Maximum Average Degree
Discussiones Mathematicae Graph Theory, 2018 A graph is said to be equitably k-colorable if the vertex set V (G) can be partitioned into k independent subsets V1, V2, . . . , Vk such that ||Vi|−|Vj || ≤ 1 (1 ≤ i, j ≤ k). A graph G is equitably k-choosable if, for any given k-uniform list assignment
Dong Aijun, Zhang Xin
doaj +4 more sources
Equitable coloring of graph products [PDF]
Opuscula Mathematica, 2006 A graph is equitably \(k\)-colorable if its vertices can be partitioned into \(k\) independent sets in such a way that the number of vertices in any two sets differ by at most one.
Hanna Furmańczyk
doaj +1 more source
Total Equitable List Coloring [PDF]
Graphs and Combinatorics, 2018 An equitable coloring is a proper coloring of a graph such that the sizes of the color classes differ by at most one. A graph $G$ is equitably $k$-colorable if there exists an equitable coloring of $G$ which uses $k$ colors, each one appearing on either $\lfloor |V(G)|/k \rfloor$ or $\lceil |V(G)|/k \rceil$ vertices of $G$. In 1994, Fu conjectured that
Kaul, Hemanshu +2 more
openaire +5 more sources
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 An equitable coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs.
Hanna Furmańczyk, Vahan Mkrtchyan
doaj +1 more source
On List Equitable Total Colorings of the Generalized Theta Graph
Discussiones Mathematicae Graph Theory, 2021 In 2003, Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A k-assignment, L, for a graph G assigns a list, L(v), of k available colors to each v ∈ V (G), and an equitable L-coloring of G is a ...
Mudrock Jeffrey A. +2 more
doaj +1 more source
A Note on the Equitable Choosability of Complete Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2021 In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A k-assignment, L, for a graph G assigns a list, L(v), of k available colors to each v ∈ V (G), and an equitable L-coloring of G is a ...
Mudrock Jeffrey A. +4 more
doaj +1 more source
Equitable Total Coloring of Corona of Cubic Graphs
Discussiones Mathematicae Graph Theory, 2021 The minimum number of total independent partition sets of V ∪ E of a graph G = (V, E) is called the total chromatic number of G, denoted by X′(G). If the di erence between cardinalities of any two total independent sets is at most one, then the minimum ...
Furmańczyk Hanna, Zuazua Rita
doaj +1 more source
A hyperedge coloring and application in combinatorial testing
AKCE International Journal of Graphs and Combinatorics, 2022 For a hypergraph H, a uniform k-coloring of hyperedges always has the same (to within 1) number of hyperedges of each color, whereas an equitable k-coloring of hyperedges has the property that at every vertex all the colors incident the same number of ...
Yasmeen Akhtar
doaj +1 more source