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 language||English (US)|
|Number of pages||8|
|State||Published - 1989|
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics