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 language | English (US) |
---|---|
Pages (from-to) | 117-124 |
Number of pages | 8 |
Journal | Annals of Discrete Mathematics |
Volume | 39 |
Issue number | C |
DOIs | |
State | Published - Jan 1 1989 |
Externally published | Yes |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics