Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings (Q2334066): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00373-019-02053-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00373-019-02053-Y / rank | |||
Normal rank | |||
Latest revision as of 01:41, 18 December 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
0 references
