Computing the anti-Ramsey number for trees in complete tripartite graph (Q6108022): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4075490 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge-colorings of complete graphs that avoid polychromatic trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2931471 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Anti-Ramsey numbers for trees in complete multi-partite graphs / rank | |||
Normal rank | |||
Revision as of 12:51, 1 August 2024
scientific article; zbMATH DE number 7704220
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the anti-Ramsey number for trees in complete tripartite graph |
scientific article; zbMATH DE number 7704220 |
Statements
Computing the anti-Ramsey number for trees in complete tripartite graph (English)
0 references
29 June 2023
0 references
anti-Ramsey number
0 references
tree
0 references
rainbow graph
0 references
