Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles (Q324825): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q128892494, #quickstatements; #temporary_batch_1724709170382 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128892494 / rank | |||
Normal rank | |||
Latest revision as of 22:54, 26 August 2024
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 |
|
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
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
