A hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...

Background: Decisions regarding strategic planning of urban freight transport very often are based on superficial assumptions inadequately reflecting the actual character of encountered challenges. The trend may be observed to adapt isolated solutions without supporting measures and verification of expected outcomes. Selected urban freight solutions have a significant potential to alleviate transport related problems, but they...