8 papers
A proof of Seymour's second neighborhood conjecture for oriented graphs with minimum out-degree equal to 7
Arpan Sadhukhan, R. B. Sandeep, Sagnik Sen
We prove Seymour's second neighborhood conjecture on oriented graphs whose minimum out-degree is equal to . This gives, to our knowledge, the first improvement of the minimum ou…
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…
Monitoring arc-geodetic sets of oriented graphs
Tapas Das, Florent Foucaud, Clara Marcille +2
Monitoring edge-geodetic sets in a graph are subsets of vertices such that every edge of the graph must lie on all the shortest paths between two vertices of the monitoring set. Th…