Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
The Chromatic Sum And Efficient Tree Algorithms, Ewa Kubicka
The Chromatic Sum And Efficient Tree Algorithms, Ewa Kubicka
Dissertations
In Chapter I this concept is introduced. It is shown that computing the chromatic sum is NP-complete. For every natural k the smallest tree which needs k colors to attain its chromatic sum is constructed. It is demonstrated that asymptotically, for each k, almost all trees require more than k colors to achieve their chromatic sums. Also a linear algorithm for a single tree is presented.
In Chapter II three constructions of graphs that require t colors beyond their chromatic number k to achieve their chromatic sum are presented, depending on the ratio ${\rm t}\over{\rm k}$. The order of the …
Measures Of Partial Association Based On Rank Estimates, Sudhakar H. Rao
Measures Of Partial Association Based On Rank Estimates, Sudhakar H. Rao
Dissertations
No abstract provided.
Greatest Common Subgraphs, Grzegorz Kubicki
Coefficients Of Multiple Determination Based On Rank Estimates, Lee D. Witt
Coefficients Of Multiple Determination Based On Rank Estimates, Lee D. Witt
Dissertations
No abstract provided.
Specified Subgraphs And Subgraph-Defined Parameters In Graphs, Karen S. Holbert
Specified Subgraphs And Subgraph-Defined Parameters In Graphs, Karen S. Holbert
Dissertations
No abstract provided.