5 citations · 8 across the 6 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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.CO2022
Triangle-free projective-planar graphs with diameter two: domination and characterization
Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee +2
In 1975, Plesník characterized all triangle-free planar graphs as having a diameter . We characterize all triangle-free projective-planar graphs having a diameter and discus…