Multicolored forests in complete bipartite graphs

DOI10.1016/S0012-365X(00)00159-XzbMath0988.05038OpenAlexW2052228082MaRDI QIDQ5948981

Richard A. Brualdi, Susan Hollingsworth

Publication date: 30 June 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00159-x

zbMATH Keywords

edge coloringcolor distributionsmulticolored trees

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Edge-disjoint rainbow spanning trees in complete graphs ⋮ The rainbow Steiner tree problem ⋮ Sufficient conditions for the existence of spanning colored trees in edge-colored graphs ⋮ On the complexity of rainbow spanning forest problem ⋮ A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph ⋮ The rainbow spanning forest problem ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Maximum colored trees in edge-colored graphs

This page was built for publication: Multicolored forests in complete bipartite graphs