Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings (Q2334066): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-019-02053-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2954615188 / rank | |||
Normal rank | |||
Revision as of 02:42, 20 March 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
