N. Narayanan

Orcid: 0000-0002-4679-2176

Affiliations:
  • IIT Madras, Chennai, India


According to our database1, N. Narayanan authored at least 28 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Proper q-caterpillars are distinguished by their Chromatic Symmetric Functions.
Discret. Math., 2024

2023
Total colorings-a survey.
AKCE Int. J. Graphs Comb., 2023

2022
Classification of COVID-19 from chest x-ray images using deep features and correlation coefficient.
Multim. Tools Appl., 2022

Strong Edge Coloring of Cayley Graphs and Some Product Graphs.
Graphs Comb., 2022

Extending some results on the second neighborhood conjecture.
Discret. Appl. Math., 2022

2021
Exact square coloring of subcubic planar graphs.
Discret. Appl. Math., 2021

Cliques in exact distance powers of graphs of given maximum degree.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020
Axiomatic characterization of the interval function of a bipartite graph.
Discret. Appl. Math., 2020

Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations.
Discret. Appl. Math., 2020

2018
Tropical dominating sets in vertex-coloured graphs.
J. Discrete Algorithms, 2018

A note on the interval function of a disconnected graph.
Discuss. Math. Graph Theory, 2018

Total Colourings - A survey.
CoRR, 2018

The Second Neighborhood Conjecture for some Special Classes of Graphs.
CoRR, 2018

2016
Partitioning a Graph into Highly Connected Subgraphs.
J. Graph Theory, 2016

Tropical Dominating Sets in Vertex-Coloured Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015
Axiomatic characterization of the interval function of a block graph.
Discret. Math., 2015

From Edge-Coloring to Strong Edge-Coloring.
Electron. J. Comb., 2015

Further results on strong edge-colourings in outerplanar graphs.
Australas. J Comb., 2015

2013
Strong Chromatic Index of 2-Degenerate Graphs.
J. Graph Theory, 2013

On a conjecture on the balanced decomposition number.
Discret. Math., 2013

2011
Oriented colouring of some graph products.
Discuss. Math. Graph Theory, 2011

Minimally 2-connected graphs and colouring problems.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
Optimal acyclic edge colouring of grid like graphs.
Discret. Math., 2010

2009
On <i>k</i>-intersection edge colourings.
Discuss. Math. Graph Theory, 2009

2008
About acyclic edge colourings of planar graphs.
Inf. Process. Lett., 2008

2007
Acyclic Edge Colouring of Outerplanar Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2005
Improved bounds on acyclic edge colouring.
Electron. Notes Discret. Math., 2005


  Loading...