Hereditary Nordhaus-Gaddum Graphs

TL;DR

This paper introduces and characterizes a hereditary class of graphs where every induced subgraph satisfies a Nordhaus-Gaddum type inequality, extending classical results and exploring structural and algorithmic properties.

Contribution

It characterizes forbidden induced subgraphs for the hereditary Nordhaus-Gaddum graphs and analyzes their intersections with other graph classes.

Findings

Characterization of forbidden induced subgraphs

Intersection with line graphs and other classes

Discussion on $ ext{chi}$-boundedness and algorithms

Abstract

Nordhaus and Gaddum proved in 1956 that the sum of the chromatic number $\chi$ of a graph $G$ and its complement is at most $|G|+1$. The Nordhaus-Gaddum graphs are the class of graphs satisfying this inequality with equality, and are well-understood. In this paper we consider a hereditary generalization: graphs $G$ for which all induced subgraphs $H$ of $G$ satisfy $\chi(H) + \chi(\overline{H}) \le |H|$. We characterize the forbidden induced subgraphs of this class and find its intersection with a number of common classes, including line graphs. We also discuss $\chi$-boundedness and algorithmic results.