Equitable colorings of corona multiproducts of graphs
From MaRDI portal
Publication:2409797
DOI10.7151/dmgt.1992zbMath1372.05071arXiv1210.6568OpenAlexW2962847588MaRDI QIDQ2409797
Hanna Furmańczyk, Marek Kubale, Vahan V. Mkrtchyan
Publication date: 13 October 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.6568
NP-completenesspolynomial algorithmequitable chromatic numbercorona graphequitable graph coloringequitable coloring conjecturemultiproduct of graphs
Related Items (2)
Equitable chromatic number of weak modular product of Some graphs ⋮ Energy and basic reproduction number of n-Corona graphs prior to order 1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for equitable coloring
- On equitable and equitable list colorings of series-parallel graphs
- Equitable colorings of planar graphs with maximum degree at least nine
- Equitable colorings of Cartesian products of graphs
- Equitable colorings of bounded treewidth graphs
- Equitable coloring and the maximum degree
- Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
- On equitable coloring of bipartite graphs
- On the corona of two graphs
- Equitable coloring of corona products of cubic graphs is harder than ordinary coloring
- Equitable Coloring
This page was built for publication: Equitable colorings of corona multiproducts of graphs