Cyriac Antony

According to our database, Cyriac Antony authored at least 10 papers between 2020 and 2025.

Collaborative distances:

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

2025

Graceful Coloring is Computationally Hard.

Cyriac Antony, Jacob Antony, Laavanya D., Devi Yamini S

Proceedings of the Algorithms and Discrete Applied Mathematics, 2025

2024

Hardness transitions and uniqueness of acyclic colouring.

M. A. Shalu, Cyriac Antony

Discret. Appl. Math., March, 2024

Graceful coloring is computationally hard.

Cyriac Antony, Laavanya D., Devi Yamini S

CoRR, 2024

Star Colouring of Regular Graphs Meets Weaving and Line Graphs.

M. A. Shalu, Cyriac Antony

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

Star colouring and locally constrained graph homomorphisms.

M. A. Shalu, Cyriac Antony

CoRR, 2023

Hardness Transitions of Star Colouring and Restricted Star Colouring.

M. A. Shalu, Cyriac Antony

CoRR, 2023

2022

Star colouring of bounded degree graphs and regular graphs.

M. A. Shalu, Cyriac Antony

Discret. Math., 2022

The complexity of restricted star colouring.

M. A. Shalu, Cyriac Antony

Discret. Appl. Math., 2022

The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs.

M. A. Shalu, Cyriac Antony

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2020

Complexity of Restricted Variant of Star Colouring.

M. A. Shalu, Cyriac Antony

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020