Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings (Q2334066): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:01, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings |
scientific article |
Statements
Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings (English)
0 references
6 November 2019
0 references
complete bipartite graph
0 references
anti-Ramsey problem
0 references
Hamiltonian cycle
0 references
perfect matching
0 references
