According to our database
1,
Sagnik Sen
authored at least 64 papers
between 2011 and 2025.
Collaborative distances:
2025
A linear algorithm for radio k-coloring of powers of paths having small diameters.
J. Comput. Syst. Sci., 2025
2024
Oriented total-coloring of oriented graphs.
Discret. Math., 2024
On (n,m)-chromatic numbers of graphs with bounded sparsity parameters.
Discret. Appl. Math., 2024
On locating and neighbor-locating colorings of sparse graphs.
Discret. Appl. Math., 2024
Algorithms and complexity for monitoring edge-geodetic sets in graphs.
CoRR, 2024
A step towards finding the analog of the Four-Color Theorem for (n,m)-graphs.
CoRR, 2024
Monitoring arc-geodetic sets of oriented graphs.
CoRR, 2024
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs.
CoRR, 2024
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024
2023
On deeply critical oriented cliques.
J. Graph Theory, September, 2023
On radio <i>k</i>-labeling of the power of the infinite path.
Inf. Process. Lett., August, 2023
Pushable chromatic number of graphs with maximum average degree at most 145.
Discret. Appl. Math., July, 2023
Triangle-free projective-planar graphs with diameter two: Domination and characterization.
Discret. Appl. Math., May, 2023
On the pushable chromatic number of various types of grids.
Discret. Appl. Math., April, 2023
On clique numbers of colored mixed graphs.
Discret. Appl. Math., 2023
Cops and robber on variants of retracts and subdivisions of oriented graphs.
CoRR, 2023
An update on (n, m)-chromatic numbers.
CoRR, 2023
On relative clique number of triangle-free planar (n, m)-graphs.
CoRR, 2023
Counting the minimum number of arcs in an oriented graph having weak diameter 2.
CoRR, 2023
A Homomorphic Polynomial for Oriented Graphs.
Electron. J. Comb., 2023
Cops and robber on variants of retracts and subdivisions of oriented graphs (Brief Announcement).
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023
Cops and Robber on Oriented Graphs with Respect to Push Operation.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023
2022
On the signed chromatic number of some classes of graphs.
Discret. Math., 2022
On fractional version of oriented coloring.
Discret. Appl. Math., 2022
The oriented relative clique number of triangle-free planar graphs is 10.
CoRR, 2022
Homomorphisms of (n, m)-graphs with respect to generalised switch.
CoRR, 2022
On Subgraph Complementation to H-free Graphs.
Algorithmica, 2022
On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022
2021
Cops and Robber on some families of oriented graphs.
Theor. Comput. Sci., 2021
Oriented bipartite graphs and the Goldbach graph.
Discret. Math., 2021
Pushable chromatic number of graphs with degree constraints.
Discret. Math., 2021
On rectangle intersection graphs with stab number at most two.
Discret. Appl. Math., 2021
2020
Relative clique number of planar signed graphs.
Discret. Appl. Math., 2020
Enumeration of edge-critical underlying absolute planar cliques for signed graphs.
Australas. J Comb., 2020
The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020
2019
Erratum to "On oriented cliques with respect to push operation" [Discrete Appl. Math. 232 (2017) 50-63].
Discret. Appl. Math., 2019
The Relative Signed Clique Number of Planar Graphs is 8.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019
2018
A study on oriented relative clique number.
Discret. Math., 2018
Erratum for "On oriented cliques with respect to push operation".
CoRR, 2018
On relative clique number of colored mixed graphs.
CoRR, 2018
On Oriented L(p, 1)-labeling.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018
2017
Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs.
J. Graph Theory, 2017
Analogues of Cliques for (m, n)-Colored Mixed Graphs.
Graphs Comb., 2017
On homomorphisms of oriented graphs with respect to the push operation.
Discret. Math., 2017
A lower bound technique for radio k-coloring.
Discret. Math., 2017
On oriented cliques with respect to push operation.
Discret. Appl. Math., 2017
On Chromatic Number of Colored Mixed Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017
2016
Outerplanar and Planar Oriented Cliques.
J. Graph Theory, 2016
Walk-Powers and Homomorphism Bounds of Planar Signed Graphs.
Graphs Comb., 2016
On Local Structures of Cubicity 2 Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2016
Relative Clique Number of Planar Signed Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016
2015
On L(k, k-1, ..., 1) labeling of triangular lattice.
Electron. Notes Discret. Math., 2015
On oriented relative clique number.
Electron. Notes Discret. Math., 2015
On homomorphism of oriented graphs with respect to push operation.
CoRR, 2015
Walk-powers and homomorphism bound of planar graphs.
CoRR, 2015
On a Special Class of Boxicity 2 Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015
2014
<i>L</i>(2, 1)-labelings of some famillies of oriented planar graphs.
Discuss. Math. Graph Theory, 2014
Homomorphisms of signed planar graphs.
CoRR, 2014
On cliques of signed and switchable signed graphs.
CoRR, 2014
2012
Maximum Order of a Planar Oclique Is 15.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012
2011
2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs.
Electron. Notes Discret. Math., 2011
