Anti-Ramsey Problems for <i>t</i> Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees (Q2811196)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Anti-Ramsey Problems for <i>t</i> Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees |
scientific article |
Statements
Anti-Ramsey Problems for <i>t</i> Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees (English)
0 references
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
