Applications of Edge Coloring of Multigraphs to Vertex Coloring of Graphs

H. A. Kierstead

doi:10.1016/S0167-5060(08)70303-0

Applications of Edge Coloring of Multigraphs to Vertex Coloring of Graphs

H. A. Kierstead

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

It is shown that if G is a graph which induces neither K_1,3 nor K₂₅₊₃^−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.

Original language	English (US)
Pages (from-to)	117-124
Number of pages	8
Journal	Annals of Discrete Mathematics
Volume	39
Issue number	C
DOIs	https://doi.org/10.1016/S0167-5060(08)70303-0
State	Published - Jan 1 1989
Externally published	Yes

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0167-5060(08)70303-0

Fingerprint Dive into the research topics of 'Applications of Edge Coloring of Multigraphs to Vertex Coloring of Graphs'. Together they form a unique fingerprint.

Cite this

@article{c637049ec2a346f4bf116aa4ca50238a,

title = "Applications of Edge Coloring of Multigraphs to Vertex Coloring of Graphs",

abstract = "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.",

author = "Kierstead, {H. A.}",

year = "1989",

month = jan,

day = "1",

doi = "10.1016/S0167-5060(08)70303-0",

language = "English (US)",

volume = "39",

pages = "117--124",

journal = "Annals of Discrete Mathematics",

issn = "0167-5060",

publisher = "Elsevier",

number = "C",

}

TY - JOUR

T1 - Applications of Edge Coloring of Multigraphs to Vertex Coloring of Graphs

AU - Kierstead, H. A.

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 -