Open this publication in new window or tab >>2010 (English)In: Ars combinatoria, ISSN 0381-7032, Vol. 95, p. 277-287Article in journal (Refereed) Published
Abstract [en]
We give an optimal degree condition for a tripartite graph to have a spanning subgraph consisting of complete graphs of order 3. This result is used to give an upper bound of 2 Delta for the strong chromatic number of n vertex graphs with Delta >= n/6.
Place, publisher, year, edition, pages
Charles Babbage Research Center, 2010
Identifiers
urn:nbn:se:umu:diva-41319 (URN)000276676500025 ()
2011-03-232011-03-232018-06-08Bibliographically approved