M. A. Shalu

Discret. Appl. Math., March, 2024

On CD-chromatic number and its lower bound in some classes of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Open Packing in Graphs: Bounds and Complexity.

[BibT_eX]

[DOI]

CoRR, 2024

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

Star Colouring of Regular Graphs Meets Weaving and Line Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

Star colouring and locally constrained graph homomorphisms.

[BibT_eX]

[DOI]

CoRR, 2023

Hardness Transitions of Star Colouring and Restricted Star Colouring.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Star colouring of bounded degree graphs and regular graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

Induced star partition of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

The complexity of restricted star colouring.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

On cd-Coloring of P5, K4-free Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

On the complexity of cd-coloring of graphs.

[BibT_eX]

[DOI]

Sandhya T. P.

Discret. Appl. Math., 2020

Complexity of Restricted Variant of Star Colouring.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

The Induced Star Partition of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

On the algorithmic aspects of strong subcoloring.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

2017

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

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Star Coloring of Graphs with Girth at Least Five.

[BibT_eX]

[DOI]

Graphs Comb., 2016

A Generalization of Join and an Algorithmic Recognition Problem.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

Tent and a subclass of P5-free graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

The cd-Coloring of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

c^2-join of graphs.

[BibT_eX]

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

2011

The Two Bicliques Problem is in NP intersection coNP

[BibT_eX]

[DOI]

CoRR, 2011

2008

Linear Chromatic Bounds for a Subfamily of 3 K 1-free Graphs.

[BibT_eX]

[DOI]

T. Karthick

Graphs Comb., 2008

2007

Perfect coloring and linearly chi-bound P6-free graphs.

[BibT_eX]

[DOI]

T. Karthick

J. Graph Theory, 2007

On Oriented Labelling Parameters.

[BibT_eX]

[DOI]

Daniel Gonçalves

André Raspaud

Proceedings of the Formal Models, 2007

2005

The class of {3K1, C4}-free graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2005

2004

Dissolved Graphs and Strong Perfect Graph Conjecture.

[BibT_eX]