Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles (Q324825)

From MaRDI portal
Revision as of 22:54, 26 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128892494, #quickstatements; #temporary_batch_1724709170382)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7066127
  • Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles
Language Label Description Also known as
English
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
scientific article; zbMATH DE number 7066127
  • Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles

Statements

Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles (English)
0 references
Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles (English)
0 references
0 references
0 references
17 October 2016
0 references
14 June 2019
0 references
monochromatic path partition
0 references
monochromatic cycle partition
0 references
two-coloured graph
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references