Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths (Q2200044)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths |
scientific article |
Statements
Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths (English)
0 references
15 September 2020
0 references
0.95219725
0 references
0.9339658
0 references
0.93150544
0 references
0.92859733
0 references
0.9277454
0 references
0.9238879
0 references
0.9221032
0 references
