On the number of rainbow spanning trees in edge-colored complete graphs

DOI10.1016/j.disc.2018.05.008zbMath1388.05062arXiv1605.04501OpenAlexW2963572511MaRDI QIDQ1637154

C. A. Rodger, Yuan-Hsun Lo, K. E. Perry, Hung-Lin Fu

Publication date: 7 June 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.04501

zbMATH Keywords

edge-coloringcomplete graphrainbow spanning tree

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)

Related Items

On the complexity of packing rainbow spanning trees ⋮ Unnamed Item ⋮ $(g,f)$-Chromatic spanning trees and forests

Cites Work

• Unnamed Item
• Edge-disjoint rainbow spanning trees in complete graphs
• Parallel concepts in graph theory
• Rainbow spanning trees in properly coloured complete graphs
• Edge-disjoint rainbow trees in properly coloured complete graphs
• On the construction of sets of integers with equal power sums
• Multicolored Isomorphic Spanning Trees in Complete Graphs
• Nonparametric inference on mtdna mismatches
• Rainbow spanning trees in complete graphs colored by one‐factorizations
• Multicolored Parallelisms of Isomorphic Spanning Trees
• Multicolored trees in complete graphs
• Multicolored trees in complete graphs

This page was built for publication: On the number of rainbow spanning trees in edge-colored complete graphs