A. Yeo

collaborators

2 papers

math.CO2023

On Seymour's and Sullivan's Second Neighbourhood Conjectures

Jiangdong Ai, Stefanie Gerke, Gregory Gutin +3

For a vertex $x$ of a digraph, $d^{+} (x)$ ( $d^{-} (x)$ , resp.) is the number of vertices at distance 1 from (to, resp.) $x$ and $d^{++} (x)$ is the number of vertices at distance 2 from…

cs.DM2020

Non-separating spanning trees and out-branchings in digraphsof independence number 2

Joergen Bang-Jensen, Stéphane Bessy, Anders Yeo

A subgraph H= (V, F) of a graph G= (V,E) is non-separating if G-F, that is, the graph obtained from G by deleting the edges in F, is connected. Analogously we say that a subdigraph…