default search action
M. A. Shalu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]M. A. Shalu, Cyriac Antony
:
Hardness transitions and uniqueness of acyclic colouring. Discret. Appl. Math. 345: 77-98 (2024) - [j14]M. A. Shalu, V. K. Kirubakaran
On CD-chromatic number and its lower bound in some classes of graphs. Discret. Appl. Math. 348: 202-210 (2024) - [c10]M. A. Shalu
Open Packing in H-free Graphs and Subclasses of Split Graphs. CALDAM 2024: 239-251 - [c9]M. A. Shalu
Star Colouring of Regular Graphs Meets Weaving and Line Graphs. CALDAM 2024: 313-327 - [i6]M. A. Shalu, V. K. Kirubakaran:
Open Packing in Graphs: Bounds and Complexity. CoRR abs/2406.06982 (2024) - 2023
- [i5]M. A. Shalu, Cyriac Antony:
Hardness Transitions of Star Colouring and Restricted Star Colouring. CoRR abs/2309.11221 (2023) - [i4]M. A. Shalu, Cyriac Antony:
Star colouring and locally constrained graph homomorphisms. CoRR abs/2312.00086 (2023) - 2022
- [j13]M. A. Shalu, S. Vijayakumar
Induced star partition of graphs. Discret. Appl. Math. 319: 81-91 (2022) - [j12]M. A. Shalu, Cyriac Antony
The complexity of restricted star colouring. Discret. Appl. Math. 319: 327-350 (2022) - [j11]M. A. Shalu, Cyriac Antony
Star colouring of bounded degree graphs and regular graphs. Discret. Math. 345(6): 112850 (2022) - [c8]M. A. Shalu
The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs. CALDAM 2022: 78-90 - [c7]M. A. Shalu
On cd-Coloring of P5, K4-free Chordal Graphs. CALDAM 2022: 127-139 - 2021
- [c6]M. A. Shalu, V. K. Kirubakaran
On cd-Coloring of Trees and Co-bipartite Graphs. CALDAM 2021: 209-221 - [i3]M. A. Shalu, Cyriac Antony:
Complexity of Restricted Star Colouring. CoRR abs/2108.02979 (2021) - 2020
- [j10]M. A. Shalu, S. Vijayakumar, Sandhya T. P.
On the complexity of cd-coloring of graphs. Discret. Appl. Math. 280: 171-185 (2020) - [c5]M. A. Shalu, Cyriac Antony
Complexity of Restricted Variant of Star Colouring. CALDAM 2020: 3-14
2010 – 2019
- 2019
- [c4]M. A. Shalu, S. Vijayakumar, T. P. Sandhya
The Induced Star Partition of Graphs. CALDAM 2019: 16-28 - 2018
- [j9]M. A. Shalu, S. Vijayakumar, S. Devi Yamini, T. P. Sandhya
On the algorithmic aspects of strong subcoloring. J. Comb. Optim. 35(4): 1312-1329 (2018) - 2017
- [j8]S. Devi Yamini, M. A. Shalu:
One-three join: A graph operation and its consequences. Discuss. Math. Graph Theory 37(3): 633-647 (2017) - [c3]M. A. Shalu, S. Vijayakumar, T. P. Sandhya
A Lower Bound of the cd-Chromatic Number and Its Complexity. CALDAM 2017: 344-355 - 2016
- [j7]M. A. Shalu, S. Devi Yamini:
Tent and a subclass of P5-free graphs. Electron. Notes Discret. Math. 53: 73-82 (2016) - [j6]M. A. Shalu, S. Devi Yamini:
A Generalization of Join and an Algorithmic Recognition Problem. Fundam. Informaticae 145(1): 81-91 (2016) - [j5]M. A. Shalu, T. P. Sandhya
Star Coloring of Graphs with Girth at Least Five. Graphs Comb. 32(5): 2121-2134 (2016) - [c2]M. A. Shalu, T. P. Sandhya
The cd-Coloring of Graphs. CALDAM 2016: 337-348 - 2015
- [i2]M. A. Shalu, S. Devi Yamini:
c^2-join of graphs. CTW 2015: 235-238 - 2011
- [i1]M. A. Shalu, S. Vijayakumar:
The Two Bicliques Problem is in NP intersection coNP. CoRR abs/1104.3463 (2011)
2000 – 2009
- 2008
- [j4]Sheshayya A. Choudum, T. Karthick, M. A. Shalu:
Linear Chromatic Bounds for a Subfamily of 3 K 1-free Graphs. Graphs Comb. 24(5): 413-428 (2008) - 2007
- [j3]Sheshayya A. Choudum, T. Karthick, M. A. Shalu:
Perfect coloring and linearly chi-bound P6-free graphs. J. Graph Theory 54(4): 293-306 (2007) - [c1]Daniel Gonçalves
On Oriented Labelling Parameters. Formal Models, Languages and Applications 2007: 34-45 - 2005
- [j2]Sheshayya A. Choudum, M. A. Shalu:
The class of {3K1, C4}-free graphs. Australas. J Comb. 32: 111-116 (2005) - 2004
- [j1]Sheshayya A. Choudum, M. A. Shalu:
Dissolved Graphs and Strong Perfect Graph Conjecture. Ars Comb. 73 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: