On the number of rainbow spanning trees in edge-colored complete graphs (Q1637154): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
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 Parallelisms of Isomorphic Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow spanning trees in properly coloured complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonparametric inference on mtdna mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint rainbow spanning trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored Isomorphic Spanning Trees in Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow spanning trees in complete graphs colored by one‐factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of sets of integers with equal power sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint rainbow trees in properly coloured complete graphs / rank
 
Normal rank

Revision as of 19:54, 15 July 2024

scientific article
Language Label Description Also known as
English
On the number of rainbow spanning trees in edge-colored complete graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references