Applications of edge coloring of multigraphs to vertex coloring of graphs

Research output: Contribution to journalArticle

4 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)117-124
Number of pages8
JournalDiscrete Mathematics
Volume74
Issue number1-2
DOIs
StatePublished - 1989
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • 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