Abstract
AbstractWe show that any complete ‐partite graph on vertices, with , whose edges are two‐coloured, can be covered with two vertex‐disjoint monochromatic paths of distinct colours, given that the largest partition class of contains at most vertices. This extends known results for complete and complete bipartite graphs.Secondly, we show that in the same situation, all but vertices of the graph can be covered with two vertex‐disjoint monochromatic cycles of distinct colours, if colourings close to a split colouring are excluded. From this we derive that the whole graph, if large enough, may be covered with 14 vertex‐disjoint monochromatic cycles.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
