Sajith Padinhatteeri

According to our database, Sajith Padinhatteeri authored at least 8 papers between 2017 and 2024.

Collaborative distances:

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

2024

s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs.

Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai

Discret. Appl. Math., March, 2024

2023

Template-driven rainbow coloring of proper interval graphs.

L. Sunil Chandran, Sajal K. Das, Pavol Hell, Sajith Padinhatteeri, Raji R. Pillai

Discret. Appl. Math., March, 2023

2021

Algorithms and Complexity of s-Club Cluster Vertex Deletion.

Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

List Distinguishing Number of p^th Power of Hypercube and Cartesian Powers of a Graph.

L. Sunil Chandran, Sajith Padinhatteeri, Karthik Ravi Shankar

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group.

Niranjan Balachandran, Sajith Padinhatteeri, Pablo Spiga

Ars Math. Contemp., 2019

2018

The list distinguishing number of Kneser graphs.

Niranjan Balachandran, Sajith Padinhatteeri

Discret. Appl. Math., 2018

2017

Distinguishing chromatic number of random Cayley graphs.

Niranjan Balachandran, Sajith Padinhatteeri

Discret. Math., 2017

<i>χ</i>_<i>D</i>(<i>G</i>), |Aut(<i>G</i>)|, and a variant of the Motion Lemma.

Niranjan Balachandran, Sajith Padinhatteeri

Ars Math. Contemp., 2017