TY - JOUR
T1 - The chromatic number of graphs which induce neither K1,3 nor K5-e
AU - Kierstead, Henry A.
AU - Schmerl, James H.
N1 - Funding Information:
supported by NSF Grant ISP-8011451. supported by NSF Grant MCS-8301603.
PY - 1986/3
Y1 - 1986/3
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=38249043609&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38249043609&partnerID=8YFLogxK
U2 - 10.1016/0012-365X(86)90142-1
DO - 10.1016/0012-365X(86)90142-1
M3 - Article
AN - SCOPUS:38249043609
SN - 0012-365X
VL - 58
SP - 253
EP - 262
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 3
ER -