## Abstract

If G is a graph which induces neither K_{1,3} nor K_{5}-e and if Δ(G)≤2ω(G)-5, then χ(G) = ω(G). Conversely, for each k ≥ 4 there is a graph G which induces neither K_{1,3} nor K_{5}-e such that ω(G) = k, Δ(G) = 2k - 3 and χ(G) = k + 1.

Original language | English (US) |
---|---|

Pages (from-to) | 253-262 |

Number of pages | 10 |

Journal | Discrete Mathematics |

Volume | 58 |

Issue number | 3 |

DOIs | |

State | Published - Mar 1986 |

Externally published | Yes |

## ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint

Dive into the research topics of 'The chromatic number of graphs which induce neither K_{1,3}nor K

_{5}-e'. Together they form a unique fingerprint.