Multicolored forests in bipartite decompositions of graphs

DOI10.1016/0095-8956(91)90059-SzbMath0763.05075MaRDI QIDQ1186126

Bryan L. Shader, Richard A. Brualdi, Noga Alon

Publication date: 28 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

colouringspanning treematchingsforestbipartite decompositionclique decompositionsnear-forestnear-tree

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (7)

Non-deterministic communication complexity with few witnesses ⋮ Subsets of a finite set that almost always intersect each other in \(\lambda\) elements ⋮ On the minimum monochromatic or multicolored subgraph partition problems ⋮ A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph ⋮ On biclique decompositions of complete \(t\)-partite graphs ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Maximum colored trees in edge-colored graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new proof of a theorem of Graham and Pollak
• Subgraphs as circuits and bases of matroids
• Decomposition of the complete r-graph into complete r-partite r-graphs
• On the decomposition ofkn into complete bipartite graphs
• On the Addressing Problem for Loop Switching
• A THEOREM ON INDEPENDENCE RELATIONS

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