21 citations · 53 across the 6 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2018
Graph reconstruction and generation from one card and the degree sequence
Andrew M. Steane
Many degree sequences can only be realised in graphs that contain a `ds-completable card', defined as a vertex-deleted subgraph in which the erstwhile neighbours of the deleted ver…
math.CO2013★ 1 cited
Minimal and irreducible links in the Shannon game
Andrew M. Steane
We discuss weak and strong links (`virtual connections') in the Shannon game. General properties of these links are discussed, leading to a method to find all links of given size b…
math.CO2012★ 2 cited
Threat, support and dead edges in the Shannon game
Andrew M. Steane
The notions of captured/lost vertices and dead edges in the Shannon game (Shannon switching game on nodes) are examined using graph theory. Simple methods are presented for identif…