M. A. Shalu

Orcid: 0000-0002-4399-0791

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Hardness transitions and uniqueness of acyclic colouring.
Discret. Appl. Math., March, 2024

On CD-chromatic number and its lower bound in some classes of graphs.
Discret. Appl. Math., 2024

Open Packing in Graphs: Bounds and Complexity.
CoRR, 2024

Open Packing in H-free Graphs and Subclasses of Split Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

Star Colouring of Regular Graphs Meets Weaving and Line Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023
Star colouring and locally constrained graph homomorphisms.
CoRR, 2023

Hardness Transitions of Star Colouring and Restricted Star Colouring.
CoRR, 2023

2022
Star colouring of bounded degree graphs and regular graphs.
Discret. Math., 2022

Induced star partition of graphs.
Discret. Appl. Math., 2022

The complexity of restricted star colouring.
Discret. Appl. Math., 2022

On cd-Coloring of P<sub>5, K<sub>4</sub></sub>-free Chordal Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021
On cd-Coloring of Trees and Co-bipartite Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020
On the complexity of cd-coloring of graphs.
Discret. Appl. Math., 2020

Complexity of Restricted Variant of Star Colouring.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
The Induced Star Partition of Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018
On the algorithmic aspects of strong subcoloring.
J. Comb. Optim., 2018

2017
One-three join: A graph operation and its consequences.
Discuss. Math. Graph Theory, 2017

A Lower Bound of the cd-Chromatic Number and Its Complexity.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
Star Coloring of Graphs with Girth at Least Five.
Graphs Comb., 2016

A Generalization of Join and an Algorithmic Recognition Problem.
Fundam. Informaticae, 2016

Tent and a subclass of P<sub>5</sub>-free graphs.
Electron. Notes Discret. Math., 2016

The cd-Coloring of Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015
c^2-join of graphs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2011
The Two Bicliques Problem is in NP intersection coNP
CoRR, 2011

2008
Linear Chromatic Bounds for a Subfamily of 3 <i>K</i> <sub>1</sub>-free Graphs.
Graphs Comb., 2008

2007
Perfect coloring and linearly chi-bound <i>P</i><sub>6</sub>-free graphs.
J. Graph Theory, 2007

On Oriented Labelling Parameters.
Proceedings of the Formal Models, 2007

2005
The class of {3K<sub>1</sub>, C<sub>4</sub>}-free graphs.
Australas. J Comb., 2005

2004
Dissolved Graphs and Strong Perfect Graph Conjecture.
Ars Comb., 2004


  Loading...