Browsing by Subject "monochromatic path partition"
Now showing items 1-1 of 1
-
(Wiley-Liss Inc., 2019)© 2018 Wiley Periodicals, Inc. We show that any complete k-partite graph G on n vertices, with k≥3, whose edges are two-coloured, can be covered with two vertex-disjoint monochromatic paths of distinct colours, given that ...