B. S. Panda and Priyamvada: Injective coloring of some subclasses of bipartite graphs and chordal graphs. Discrete Applied Mathematics, 291, 68-87, 2021.
Priyamvada and B. S. Panda: Exact square coloring of certain classes of graphs: Complexity and algorithms. Theoretical Computer Science, 932, 84-101, 2022.
B. S. Panda and Priyamvada: Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs. Theoretical Computer Science, 906, 32-51, 2022.
Priyamvada and B. S. Panda: Exact square coloring of graphs resulting from some graph operations and products. AKCE International Journal of Graphs and Combinatorics, 19(3), 211-220, 2022.
Priyamvada and B. S. Panda: Complexity and algorithms for injective edge coloring of graphs. Theoretical Computer Science, 968, 2023.
Priyamvada and B. S. Panda: Injective edge coloring of graphs resulting from some graph operations and products. accepted for publication in Discrete Mathematics, Algorithms and Applications, 2024.
Priyamvada: Tight bounds on odd chromatic number of some standard graph products. accepted for publication in Discrete Applied Mathematics, 2025.