2 papers
math.CO2026
Algorithms for the Maximum Edge Open Packing Problem
Sriram Bhyravarapu, Gautam K. Das, Kamal Santra
Packing problems form a central theme in graph theory, owing to their relevance in modeling conflict-free resource allocation, network design, and communication constraints. Motiva…
cs.DS2025
On the Parameterized Complexity of Odd Coloring
Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy
A proper vertex coloring of a connected graph is called an odd coloring if, for every vertex in , there exists a color that appears odd number of times in the open neigh…