Applications of edge coloring of multigraphs to vertex coloring of graphs

H. A. Kierstead

doi:10.1016/0012-365X(89)90203-3

Applications of edge coloring of multigraphs to vertex coloring of graphs

H. A. Kierstead

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

4 Scopus citations

Abstract

It is shown that if G is a graph which induces neither K_1,3 nor K_2S+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.

Original language	English (US)
Pages (from-to)	117-124
Number of pages	8
Journal	Discrete Mathematics
Volume	74
Issue number	1-2
DOIs	https://doi.org/10.1016/0012-365X(89)90203-3
State	Published - 1989
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/0012-365X(89)90203-3

Cite this

@article{413b8a0672874c5ea0abb1c66873399e,

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 K2S+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.}",

note = "Funding Information: * Partially supported by ONR contract NO0014-85K-0494.",

year = "1989",

doi = "10.1016/0012-365X(89)90203-3",

language = "English (US)",

volume = "74",

pages = "117--124",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-2",

}

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 NO0014-85K-0494.

PY - 1989

Y1 - 1989

N2 - It is shown that if G is a graph which induces neither K1,3 nor K2S+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 K2S+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=38249023163&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249023163&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(89)90203-3

DO - 10.1016/0012-365X(89)90203-3

M3 - Article

AN - SCOPUS:38249023163

SN - 0012-365X

VL - 74

SP - 117

EP - 124

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-2

ER -

Applications of edge coloring of multigraphs to vertex coloring of graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this