
In 1982, Berge defined the class of χ-diperfect digraphs. A digraph D is χ-diperfect if for every induced subdigraph H of D and every minimum coloring S of H there exists a path P of H with exactly one vertex of each color class of S. Berge also showed examples of non-χ-diperfect orientations of odd cycles and their complements. The ultimate goal in this research area is to obtain a characterization of χ-diperfect digraphs in terms of forbidden induced subdigraphs. In this work, we give steps towards this goal by presenting characterizations of orientations of odd cycles and their complements that are χ-diperfect. We also show that certain classes of digraphs are χ-diperfect. Moreover, we present minimal non-χ-diperfect digraphs that were unknown.
Coloring of graphs and hypergraphs, Directed graphs (digraphs), tournaments, \( \chi \)-diperfect digraphs, coloring, digraphs, perfect graphs
Coloring of graphs and hypergraphs, Directed graphs (digraphs), tournaments, \( \chi \)-diperfect digraphs, coloring, digraphs, perfect graphs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
