Partitioning a graph into monochromatic connected subgraphs (Q5229539)
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 a graph into monochromatic connected subgraphs |
scientific article; zbMATH DE number 7094896
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning a graph into monochromatic connected subgraphs |
scientific article; zbMATH DE number 7094896 |
Statements
Partitioning a graph into monochromatic connected subgraphs (English)
0 references
15 August 2019
0 references
covering
0 references
edge colorings
0 references
monochromatic connected subgraphs
0 references
partitioning
0 references
0.8846426010131836
0 references
0.8524013161659241
0 references
0.8471924662590027
0 references
0.8465347290039062
0 references
0.8426514267921448
0 references
