Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
Shasha Ma and
Liancui Zuo ()
Additional contact information
Shasha Ma: Tianjin Normal University
Liancui Zuo: Tianjin Normal University
Journal of Combinatorial Optimization, 2016, vol. 32, issue 3, No 5, 725-740
Abstract:
Abstract A graph G is said to be equitably k-colorable if the vertex set of G can be divided into k independent sets for which any two sets differ in size at most one. The equitable chromatic number of G, $$\chi _{=}(G)$$ χ = ( G ) , is the minimum k for which G is equitably k-colorable. The equitable chromatic threshold of G, $$\chi _{=}^{*}(G)$$ χ = ∗ ( G ) , is the minimum k for which G is equitably $$k'$$ k ′ -colorable for all $$k'\ge k$$ k ′ ≥ k . In this paper, the exact values of $$\chi _{=}^{*}(G\Box H)$$ χ = ∗ ( G □ H ) and $$\chi _{=}(G\Box H)$$ χ = ( G □ H ) are obtained when G is the square of a cycle or a path and H is a complete bipartite graph.
Keywords: Equitable coloring; Equitable chromatic number; Equitable chromatic threshold; Cartesian product (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9895-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:32:y:2016:i:3:d:10.1007_s10878-015-9895-5
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-015-9895-5
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().