Showing cs.DMShow all
3 papers · 1 filter
cs.DM2025
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…
cs.DM2025
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…
cs.DM2025
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…