Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Eccentricity Shortest Path: the structural parameter landscape
Anand Babu, Ashwin Jacob, Hitendra Kumar +1
The Eccentricity Shortest Path problem asks, given a connected graph and a nonnegative integer , whether some shortest path is within distance of every vertex. We study its…
cs.DS2026
The Complexity of Hamiltonian Cycles and Paths with Prescribed Walk Lengths
Hitendra Kumar, Mathieu Mari, R. B. Sandeep
Fix a set of positive integers. An -Hamiltonian cycle is a cyclic ordering of all vertices of a graph such that each consecutive pair is joined by a walk whose length belong…
math.CO2026
Tight Upper Bounds on Color Reversal by Local Inversions
Hitendra Kumar, Kumud Singh Porte, R. B. Sandeep
A bicoloration of a graph is a map . A local inversion at a vertex complements the subgraph induced by the neighbors of and simultaneously reverse…