Equitable coloring of corona products of cubic graphs is harder than ordinary coloring

DOI10.26493/1855-3974.687.99bzbMath1347.05064arXiv1409.0650OpenAlexW2964017825MaRDI QIDQ2827784

Hanna Furmańczyk, Marek Kubale

Publication date: 21 October 2016

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.0650

zbMATH Keywords

cubic graphpolynomial algorithmNP-hardnessequitable chromatic numbercorona graphequitable graph coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

On the \(r\)-dynamic coloring of subdivision-edge coronas of a path ⋮ Equitable colorings of corona multiproducts of graphs ⋮ Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines ⋮ Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs ⋮ Equitable total coloring of corona of cubic graphs ⋮ Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms ⋮ Energy and basic reproduction number of n-Corona graphs prior to order 1

This page was built for publication: Equitable coloring of corona products of cubic graphs is harder than ordinary coloring