M. A. Shalu

According to our database, M. A. Shalu authored at least 28 papers between 2004 and 2024.

Collaborative distances:

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

2024

Hardness transitions and uniqueness of acyclic colouring.

M. A. Shalu, Cyriac Antony

Discret. Appl. Math., March, 2024

Open Packing in H-free Graphs and Subclasses of Split Graphs.

M. A. Shalu, V. K. Kirubakaran

Proceedings of the Algorithms and Discrete Applied Mathematics, 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

Induced star partition of graphs.

M. A. Shalu, S. Vijayakumar, T. P. Sandhya, Joyashree Mondal

Discret. Appl. Math., 2022

The complexity of restricted star colouring.

M. A. Shalu, Cyriac Antony

Discret. Appl. Math., 2022

On cd-Coloring of P_{5, K₄}-free Chordal Graphs.

M. A. Shalu, V. K. Kirubakaran

Proceedings of the Algorithms and Discrete Applied Mathematics, 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

2021

On cd-Coloring of Trees and Co-bipartite Graphs.

M. A. Shalu, V. K. Kirubakaran

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

On the complexity of cd-coloring of graphs.

M. A. Shalu, S. Vijayakumar, Sandhya T. P.

Discret. Appl. Math., 2020

Complexity of Restricted Variant of Star Colouring.

M. A. Shalu, Cyriac Antony

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

The Induced Star Partition of Graphs.

M. A. Shalu, S. Vijayakumar, T. P. Sandhya

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

On the algorithmic aspects of strong subcoloring.

M. A. Shalu, S. Vijayakumar, S. Devi Yamini, T. P. Sandhya

J. Comb. Optim., 2018

2017

One-three join: A graph operation and its consequences.

S. Devi Yamini, M. A. Shalu

Discuss. Math. Graph Theory, 2017

A Lower Bound of the cd-Chromatic Number and Its Complexity.

M. A. Shalu, S. Vijayakumar, T. P. Sandhya

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Star Coloring of Graphs with Girth at Least Five.

M. A. Shalu, T. P. Sandhya

Graphs Comb., 2016

A Generalization of Join and an Algorithmic Recognition Problem.

M. A. Shalu, S. Devi Yamini

Fundam. Informaticae, 2016

Tent and a subclass of P₅-free graphs.

M. A. Shalu, S. Devi Yamini

Electron. Notes Discret. Math., 2016

The cd-Coloring of Graphs.

M. A. Shalu, T. P. Sandhya

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

c^2-join of graphs.

M. A. Shalu, S. Devi Yamini

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2011

The Two Bicliques Problem is in NP intersection coNP

M. A. Shalu, S. Vijayakumar

CoRR, 2011

2008

Linear Chromatic Bounds for a Subfamily of 3 <i>K</i> ₁-free Graphs.

Sheshayya A. Choudum, T. Karthick, M. A. Shalu

Graphs Comb., 2008

2007

Perfect coloring and linearly chi-bound <i>P</i>₆-free graphs.

Sheshayya A. Choudum, T. Karthick, M. A. Shalu

J. Graph Theory, 2007

On Oriented Labelling Parameters.

Daniel Gonçalves, André Raspaud, M. A. Shalu

Proceedings of the Formal Models, 2007

2005

The class of {3K₁, C₄}-free graphs.

Sheshayya A. Choudum, M. A. Shalu

Australas. J Comb., 2005

2004

Dissolved Graphs and Strong Perfect Graph Conjecture.

Sheshayya A. Choudum, M. A. Shalu

Ars Comb., 2004