The color-degree matrix and the number of multicolored trees in star decompositions

DOI10.1006/JCTB.1994.1014MaRDI QIDQ1322016zbMATH OpenOpenAlexFDO

Authors Jiuqiang Liu, Allen J. Schwenk

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

zbMATH Keywords

tournamentsdecompositionscolor-degree matrixmulticolored spanning treesmulticolored treesstar decompositions

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 139929
• scientific article; zbMATH DE number 7351424
• ON STAR COLORING OF DEGREE SPLITTING OF COMB PRODUCT GRAPHS
• Multicolored forests in bipartite decompositions of graphs
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• Multicolored trees in complete graphs
• Multicolored trees in complete graphs
• On the degree-chromatic polynomial of a tree
• On the degree-chromatic polynomial of a tree
• scientific article; zbMATH DE number 1929966

Cited in

(2)

• scientific article; zbMATH DE number 7351424 (Why is no real title available?)
• scientific article; zbMATH DE number 139929 (Why is no real title available?)

This page was built for publication: The color-degree matrix and the number of multicolored trees in star decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322016)