umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Factors of r-partite graphs and bounds for the strong chromatic number
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2010 (English)In: Ars combinatoria, ISSN 0381-7032, Vol. 95, 277-287 p.Article 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. Vol. 95, 277-287 p.
Identifiers
URN: urn:nbn:se:umu:diva-41319ISI: 000276676500025OAI: oai:DiVA.org:umu-41319DiVA: diva2:405618
Available from: 2011-03-23 Created: 2011-03-23 Last updated: 2017-12-11Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Johansson, RobertMarkström, Klas
By organisation
Department of Mathematics and Mathematical Statistics
In the same journal
Ars combinatoria

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 227 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf