On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs. - Soumen Nandi; Sagnik Sen 001; S. Taruni (IWOCA, 2022)

Homomorphisms of (n, m)-graphs with respect to generalised switch. - Sagnik Sen 001; Éric Sopena; S. Taruni (CoRR, 2022)

On relative clique number of triangle-free planar (n, m)-graphs. - Soumen Nandi; Sagnik Sen 001; S. Taruni (CoRR, 2023)

An update on (n, m)-chromatic numbers. - Sandip Das 001; Abhiruk Lahiri; Soumen Nandi; Sagnik Sen 001; S. Taruni (CoRR, 2023)

Winding number and circular 4-coloring of signed graphs. - Anna Gujgiczer; Reza Naserasr; Rohini S; S. Taruni (CoRR, 2023)

Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity. - Florent Foucaud; Pierre-Marie Marcille; Zin Mar Myint; R. B. Sandeep; Sagnik Sen 001; S. Taruni (CALDAM, 2024)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. - Florent Foucaud; Pierre-Marie Marcille; Zin Mar Myint; R. B. Sandeep; Sagnik Sen 001; S. Taruni (CoRR, 2024)

A step towards finding the analog of the Four-Color Theorem for (n,m)-graphs. - Susobhan Bandopadhyay; Sagnik Sen 001; S. Taruni (CoRR, 2024)

Algorithms and complexity for monitoring edge-geodetic sets in graphs. - Florent Foucaud; Clara Marcille; R. B. Sandeep; Sagnik Sen 001; S. Taruni (CoRR, 2024)

On (n,m)-chromatic numbers of graphs with bounded sparsity parameters. - Sandip Das 001; Abhiruk Lahiri; Soumen Nandi; Sagnik Sen 001; S. Taruni (Discret. Appl. Math., 2024)

On Coloring Parameters of Triangle-Free Planar (n, m)-Graphs. - Soumen Nandi; Sagnik Sen 001; S. Taruni (Graphs Comb., 2024)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. - Florent Foucaud; Clara Marcille; Zin Mar Myint; R. B. Sandeep; Sagnik Sen 001; S. Taruni (Discret. Appl. Math., 2025)