Skip to content

Author

C. U. Angeliya

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Sep 2026

Optimal chromatic bounds to two open problems on P 5 -free graphs

Let [Formula: see text] and [Formula: see text] respectively denote the chromatic number and clique number of a graph [Formula: see text]. In this paper, we present our contributions to two open problems on the coloring of [Formula: see text]-free graphs. A question posed by Gyárfás (1987) asks for the smallest [Formul...

C. U. Angeliya, S. Choudum, Mayamma Joseph · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.