Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees (Q2811196)
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: Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees |
scientific article; zbMATH DE number 6591586
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees |
scientific article; zbMATH DE number 6591586 |
Statements
10 June 2016
0 references
spanning subgraph
0 references
rainbow
0 references
anti-Ramsey number
0 references
perfect matching
0 references
Hamiltonian cycle
0 references
spanning tree
0 references
Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees (English)
0 references
