Abstract

It is proved that for every k-optimal path partition of a diagraph in which each component contains at most one cycle, there exists a partial k-coloring which colors strongly every path of the partition.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call