On the number of heterochromatic trees in nice and beautiful colorings of complete graphs (Q2062897): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Multicolored trees in complete graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multicolored trees in complete graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2732627 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5684698 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4401957 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5589124 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph / rank | |||
Normal rank |
Latest revision as of 14:49, 27 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the number of heterochromatic trees in nice and beautiful colorings of complete graphs |
scientific article |
Statements
On the number of heterochromatic trees in nice and beautiful colorings of complete graphs (English)
0 references
3 January 2022
0 references
heterochromatic spanning trees
0 references
graceful colourings
0 references
nice colourings
0 references
0 references