Applications of Edge Coloring of Multigraphs to Vertex Coloring of Graphs

Research output: Contribution to journalArticle

1 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)117-124
Number of pages8
JournalAnnals of Discrete Mathematics
Volume39
Issue numberC
DOIs
StatePublished - Jan 1 1989
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

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