Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings (Q2334066)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7127299
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings |
scientific article; zbMATH DE number 7127299 |
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
0.910836398601532
0 references
0.9033138155937196
0 references
0.8763493895530701
0 references
0.8601645231246948
0 references
0.8526246547698975
0 references
