The color-degree matrix and the number of multicolored trees in star decompositions
DOI10.1006/JCTB.1994.1014zbMath0794.05049OpenAlexW2084584315MaRDI QIDQ1322016
Allen J. Schwenk, Jiuqiang Liu
Publication date: 13 September 1994
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1994.1014
decompositionstournamentsmulticolored treesmulticolored spanning treescolor-degree matrixstar decompositions
Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
This page was built for publication: The color-degree matrix and the number of multicolored trees in star decompositions