Get started
Author

Ushnish Sarkar

ORCID: 0000-0002-3884-2911
Observed ORCID: 0000-0002-3884-2911
OpenAlex ID: A5003281738
On characterizing radio k -coloring problem by path covering problem
2014 · Ushnish Sarkar, Avishek Adhikari · Discrete Mathematics · 11
PDF
On relationship between Hamiltonian path and holes in L(3,2,1) -coloring of minimum span
2017 · Ushnish Sarkar, Avishek Adhikari · Discrete Applied Mathematics · 2
PDF
Hole: An Emerging Character in the Story of Radio k-Coloring Problem
2017 · Ushnish Sarkar, Avishek Adhikari · Springer eBooks · 1
A new graph parameter and a construction of larger graph without increasing radio k-chromatic number
2016 · Ushnish Sarkar, Avishek Adhikari · Journal of Combinatorial Optimization · 1
A note on robber locating game
2026 · Rahul Das, Ushnish Sarkar · Discrete Applied Mathematics
Lower Bounds of Location Numbers
2026 · Rahul Das, Soumen Nandi, et al. · Lecture notes in computer science
A note on obtaining bipartite radio graceful graphs of arbitrarily large radio numbers with radio graceful complements
2025 · Ushnish Sarkar · Discrete Applied Mathematics
On the Universality and Extremality of Graphs with a Distance Constrained Colouring
2022 · Kaushik Majumder, Ushnish Sarkar · Annals of Combinatorics
PDF
Works count: 8
Citation count: 15
H-index: 2
I10-index: 1
Year
Topic
Type