Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546)
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 2-edge-colored graphs by monochromatic paths and cycles |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning 2-edge-colored graphs by monochromatic paths and cycles |
scientific article |
Statements
Partitioning 2-edge-colored graphs by monochromatic paths and cycles (English)
0 references
7 January 2015
0 references
