output
20172025
most citedAn Evaluation Tool for Backbone Extraction Techniques in Weighted Complex Networks

28 citations

Showing math.COShow all

6 papers · 1 filter

math.CO2025

Seeing is not believing in limited visibility cops and robbers

Bojan Bašić, Alfie Davies, Aleksa Džuklevski +2

We consider the model of limited visibility Cops and Robbers, where the cops can only see within their -neighbourhood. We prove that the number of cops needed to see the robber…

math.CO2024

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles

Kyle Burke, Antoine Dailly, Nacim Oijid

Arc-Kayles is a game where two players alternate removing two adjacent vertices until no move is left, the winner being the player who played the last move. Introduced in 1978, its…

math.CO2024★ 9 cited

The Maker-Breaker Largest Connected Subgraph Game

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney +2

Given a graph and , we introduce the following game played in . Each round, Alice colours an uncoloured vertex of red, and then Bob colours one blue (i…

math.CO2022

Incidence, a Scoring Positional Game on Graphs

Guillaume Bagan, Quentin Deschamps, Eric Duchêne +5

Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investigated in the literature since then. These games are played on a hypergraph where…

math.CO2022★ 6 cited

Revisiting and improving upper bounds for identifying codes

Florent Foucaud, Tuomo Lehtilä

An identifying code of a graph is a dominating set of such that any two distinct vertices of have distinct closed neighbourhoods within . These codes have been w…

math.CO2020★ 20 cited

Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces

Marthe Bonamy, Nicolas Bousquet, Louis Esperet +4

The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. In this paper, we study the asymptotic dimension of metric…