Showing math.COShow all
2 papers · 1 filter
math.CO2025
Isometric and induced path partitions: a new upper bound and a characterization of some extremal graphs
Irena Penev, R. B. Sandeep, D. K. Supraja +1
An \textit{isometric path} is a shortest path between two vertices. An \textit{isometric path partition} (IPP) of a graph is a set of vertex-disjoint isometric pa…
math.CO2024
On locating and neighbor-locating colorings of sparse graphs
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi +2
A proper -coloring of a graph is a \emph{neighbor-locating -coloring} if for each pair of vertices in the same color class, the two sets of colors found in their respecti…