6 papers
Homomorphisms of (n,m)-graphs with respect to generalised switch
Sagnik Sen, Ãric Sopena, S Taruni
The study of homomorphisms of -graphs, that is, adjacency preserving vertex mappings of graphs with types of arcs and types of edges was initiated by NeÅ¡etÅil and…
On arc-density of pushably -critical oriented graphs
Tapas Das, Pavan P D, Sagnik Sen +1
An oriented graph is pushably -critical if it is not pushably -colorable, but every proper subgraph of is. The main result of this a…
Large planar -cliques
Susobhan Bandopadhyay, Sagnik Sen, S Taruni
An \textit{-graph} is a graph having both arcs and edges, and its arcs (resp., edges) are labeled using one of the (resp., ) different symbols. An \textit{…
Algorithms and complexity for monitoring edge-geodetic sets in graphs
Florent Foucaud, Clara Marcille, R. B. Sandeep +2
A monitoring edge-geodetic set of a graph is a subset of its vertices such that for every edge in the graph, deleting increases the distance between at least one pair o…
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
Florent Foucaud, Clara Marcille, Zin Mar Myint +3
A monitoring edge-geodetic set, or simply an MEG-set, of a graph is a vertex subset such that given any edge of , lies on every shortest - p…
On fundamental results for pushable homomorphisms of oriented graphs
Tapas Das, Pavan P D, Sagnik Sen +1
This article deals with homomorphisms of oriented graphs with respect to push equivalence. Here homomorphisms refer to arc preserving vertex mappings, and push equivalence refers t…