Dibyayan Chakraborty

activity

20242026

most citedAlgorithms and complexity for geodetic sets on planar and chordal graphs

3 citations · 3 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

$K_{2, 3}$ -induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two

Dibyayan Chakraborty

A graph $H$ is an \emph{induced minor} of a graph $G$ if $H$ can be obtained from $G$ by a sequence of edge contractions and vertex deletions. Otherwise, $G$ is \emph{ $H$ -induced m…

math.CO2025

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations

Dibyayan Chakraborty, Florent Foucaud

The (strong) isometric path complexity is a recently introduced graph invariant that captures how arbitrary isometric paths (i.e., shortest paths) of a graph can be viewed as a uni…

math.CO2025

Isometric path complexity of graphs

A set $S$ of isometric paths of a graph $G$ is `` $v$ -rooted'', where $v$ is a vertex of $G$ , if $v$ is one of the endpoints of all the isometric paths in $S$ . The isometric path co…

math.CO2024

Kempe Equivalent List Colorings Revisited

Dibyayan Chakraborty, Carl Feghali, Reem Mahmoud

A \emph{Kempe chain} on colors $a$ and $b$ is a component of the subgraph induced by colors $a$ and $b$ . A \emph{Kempe change} is the operation of interchanging the colors of some…

K2,3​-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations

Isometric path complexity of graphs

Kempe Equivalent List Colorings Revisited

$K_{2, 3}$ -induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two