C. U. Angeliya

According to our database, C. U. Angeliya authored at least 3 papers between 2025 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

On near optimal colorable graphs.

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

Discret. Appl. Math., 2026

2025

Towards Optimal χ-Binding Functions of ($2K_1 \cup K_2$)-Free Graphs and ($P_3 \cup K_1$)-Free Graphs.

C. U. Angeliya, Sheshayya A. Choudum, Mayamma Joseph

Graphs Comb., April, 2025

Coloring of (P₂+P₄, K₄-e)-free graphs.

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

CoRR, January, 2025