C. U. Angeliya

collaborators

2 papers

cs.DM2025

On near optimal colorable graphs

C. U. Angeliya, Arnab Char, T. Karthick

A class of graphs $G$ is said to be \emph{near optimal colorable} if there exists a constant $c \in N$ such that every graph $G \in G$ satisfies $Ï(G) \leq \max\{…

math.CO2025

( $P_{2} + P_{4}$ , $K_{4} - e$ )-free graphs are nearly $I ¨ $ -colorable

C. U. Angeliya, T. Karthick, Shenwei Huang

For a graph $G$ , $I ¨ (G)$ and $I ¨ (G)$ respectively denote the chromatic number and clique number of $G$ . In this paper, we show the following results: (i) If $G$ is a ( $P_{2} + P_{4}$ , $K…

On near optimal colorable graphs

(P2​+P4​, K4​−e)-free graphs are nearly I¨-colorable

( $P_{2} + P_{4}$ , $K_{4} - e$ )-free graphs are nearly $I ¨ $ -colorable