Coloring graphs with no induced five‐vertex path or gem
Coloring graphs with no induced five‐vertex path or gem
Abstract For a graph , let and , respectively, denote the chromatic number and clique number of . We give an explicit structural description of (, gem)‐free graphs, and show that every such graph satisfies . Moreover, this bound is best possible. Here a gem is the graph that consists …