TY - JOUR
T1 - Applications of Edge Coloring of Multigraphs to Vertex Coloring of Graphs
AU - Kierstead, H. A.
N1 - Funding Information:
* Partially supported by ONR contract NOOO14-85K-0494.
PY - 1989/1/1
Y1 - 1989/1/1
N2 - It is shown that if G is a graph which induces neither K1,3 nor K25+3−e and ω(G) is sufficiently large then χ(G) ⩽ ω(G) +s. This result is established by first demonstrating a correspondence between vertex coloring G and edge coloring a certain multigraph and then applying a known result on edge coloring.
AB - It is shown that if G is a graph which induces neither K1,3 nor K25+3−e and ω(G) is sufficiently large then χ(G) ⩽ ω(G) +s. This result is established by first demonstrating a correspondence between vertex coloring G and edge coloring a certain multigraph and then applying a known result on edge coloring.
UR - http://www.scopus.com/inward/record.url?scp=77957092403&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77957092403&partnerID=8YFLogxK
U2 - 10.1016/S0167-5060(08)70303-0
DO - 10.1016/S0167-5060(08)70303-0
M3 - Article
AN - SCOPUS:77957092403
VL - 39
SP - 117
EP - 124
JO - Annals of Discrete Mathematics
JF - Annals of Discrete Mathematics
SN - 0167-5060
IS - C
ER -