Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
From MaRDI portal
Publication:4971610
DOI10.1515/acsc-2015-0007zbMath1462.05138OpenAlexW2234185770MaRDI QIDQ4971610
Hanna Furmańczyk, Marek Kubale
Publication date: 12 October 2020
Published in: Archives of Control Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/acsc-2015-0007
Related Items (5)
On bipartization of cubic graphs by removal of an independent set ⋮ Equitable coloring of hypergraphs ⋮ Scheduling on uniform machines with a conflict graph: complexity and resolution ⋮ Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs ⋮ Scheduling identical jobs on uniform machines with a conflict graph
Cites Work
This page was built for publication: Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
