On heterochromatic out-directed spanning trees in tournaments

DOI10.1007/S00373-015-1532-7zbMath1338.05092arXiv1601.04170OpenAlexW2077622683MaRDI QIDQ5964994

Juan José Montellano-Ballesteros, Eduardo Rivera-Campo

Publication date: 2 March 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

tournamentheterochromatic subgraphsout-directed tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Rainbow spanning subgraphs of small diameter in edge-colored complete graphs
• Edge-disjoint rainbow spanning trees in complete graphs
• The anti-Ramsey number of perfect matching
• On restricted colourings of \(K_ n\)
• Rainbows in the hypercube
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• An anti-Ramsey Theorem on edge-cutsets
• An anti-Ramsey theorem

This page was built for publication: On heterochromatic out-directed spanning trees in tournaments