Name
Title | ||
|---|---|---|
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles. |
Abstract | ||
|---|---|---|
We show that any complete k-partite graph G on n vertices, with k≥3, whose edges are two-coloured, and whose largest partition class contains at most n/2 vertices, can be covered with two vertex-disjoint monochromatic paths of distinct colours. This extends known results for complete and complete bipartite graphs. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.endm.2015.07.052 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
monochromatic path partition,monochromatic cycle partition,two-coloured graph | Pseudoforest,Complete graph,Discrete mathematics,Combinatorics,Graph power,Graph homomorphism,Cycle graph,Pancyclic graph,Mathematics,Complement graph,Path graph | Journal |
Volume | ISSN | Citations |
50 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 10 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oliver Schaudt | 1 | 95 | 21.74 |
| maya stein | 2 | 81 | 15.65 |