S. Taruni

According to our database¹, S. Taruni authored at least 12 papers between 2022 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2025

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2025

2024

On Coloring Parameters of Triangle-Free Planar (n, m)-Graphs.

[BibT_eX]

[DOI]

Soumen Nandi

Sagnik Sen

S. Taruni

Graphs Comb., December, 2024

On (n,m)-chromatic numbers of graphs with bounded sparsity parameters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Algorithms and complexity for monitoring edge-geodetic sets in graphs.

[BibT_eX]

[DOI]

CoRR, 2024

A step towards finding the analog of the Four-Color Theorem for (n,m)-graphs.

[BibT_eX]

[DOI]

Susobhan Bandopadhyay

Sagnik Sen

S. Taruni

CoRR, 2024

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs.

[BibT_eX]

[DOI]

Florent Foucaud

Pierre-Marie Marcille

CoRR, 2024

Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity.

[BibT_eX]

[DOI]

Florent Foucaud

Pierre-Marie Marcille

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

Winding number and circular 4-coloring of signed graphs.

[BibT_eX]

[DOI]

CoRR, 2023

An update on (n, m)-chromatic numbers.

[BibT_eX]

[DOI]

CoRR, 2023

On relative clique number of triangle-free planar (n, m)-graphs.

[BibT_eX]

[DOI]

Soumen Nandi

Sagnik Sen

S. Taruni

CoRR, 2023

2022

Homomorphisms of (n, m)-graphs with respect to generalised switch.

[BibT_eX]

[DOI]

Sagnik Sen

Éric Sopena

S. Taruni

CoRR, 2022

On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs.

[BibT_eX]

[DOI]

Soumen Nandi

Sagnik Sen

S. Taruni

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

S. Taruni

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...