An Upper Bound to the Chromatic Number of a Uniform Hypergraph without Cycles of Length Two or Three Journalartikel uri icon

 

Abstract

  • In this paper, we establish a new upper bound to the chromatic number of a uniform hypergraph having no cycles of length two or three. The proof is based on a recent lower bound to the chromatic polynomial.

Veröffentlichungszeitpunkt

  • 1999

Review-Status

  • Peer-Reviewed

Heftnummer

  • 1-2

Band

  • 36

Startseite

  • 55

letzte Seite

  • 56

Seitenzahl

  • 2