The chromatic number of graphs which induce neither K1,3 nor K5-e

Henry A. Kierstead, James H. Schmerl

Research output: Contribution to journalArticle

9 Scopus citations

Abstract

If G is a graph which induces neither K1,3 nor K5-e and if Δ(G)≤2ω(G)-5, then χ(G) = ω(G). Conversely, for each k ≥ 4 there is a graph G which induces neither K1,3 nor K5-e such that ω(G) = k, Δ(G) = 2k - 3 and χ(G) = k + 1.

Original languageEnglish (US)
Pages (from-to)253-262
Number of pages10
JournalDiscrete Mathematics
Volume58
Issue number3
DOIs
StatePublished - Mar 1986
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'The chromatic number of graphs which induce neither K<sub>1,3</sub> nor K<sub>5</sub>-e'. Together they form a unique fingerprint.

  • Cite this