Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees (Q2479574)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5259456
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees |
scientific article; zbMATH DE number 5259456 |
Statements
Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees (English)
0 references
4 April 2008
0 references
complete multipartite graphs
0 references
graph partitioning
0 references
monochromatic subgraphs
0 references
complexity
0 references
0.8547289371490479
0 references
0.8405578136444092
0 references
0.8165189623832703
0 references
