Showing math.COShow all
3 papers · 1 filter
math.CO2026
Results on Cartesian -capacity of graphs
Mateja Grašič, Christopher Mouron, Aljoša Šubašić +2
The concept of graph capacity extends graph span by considering the maximum number of agents that can simultaneously traverse a graph while preserving a prescribed minimum distance…
math.CO2026
Span capacities of graphs
Mateja Grašič, Christopher Mouron, Aljoša Šubašić +2
The -capacity of a graph is introduced as the maximum number of players that can simultaneously traverse such that each player visits all vertices while maintaining a di…
math.CO2024
The strong vertex span of trees
Mateja Grašič, Chris Mouron, Andrej Taranenko
The strong vertex (edge) span of a given graph is the maximum distance that two players can maintain at all times while visiting all vertices (edges) of and moving either t…