18 citations · 24 across the 18 of their papers we have counts for
18 papers
Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
Stefanie Gerke, Gregory Gutin, Anders Yeo +1
A bisection in a graph is a cut in which the number of vertices in the two parts differ by at most 1. In this paper, we give lower bounds for the maximum weight of bisections of ed…
On Seymour's and Sullivan's Second Neighbourhood Conjectures
Jiangdong Ai, Stefanie Gerke, Gregory Gutin +3
For a vertex of a digraph, (, resp.) is the number of vertices at distance 1 from (to, resp.) and is the number of vertices at distance 2 from…
Bounds on Maximum Weight Directed Cut
Jiangdong Ai, Stefanie Gerke, Gregory Gutin +2
We obtain lower and upper bounds for the maximum weight of a directed cut in the classes of weighted digraphs and weighted acyclic digraphs as well as in some of their subclasses.…
Results on the Small Quasi-Kernel Conjecture
Jiangdong Ai, Stefanie Gerke, Gregory Gutin +2
A {\em quasi-kernel} of a digraph is an independent set such that for every vertex , there exists a directed path with one or two arcs…
Extended Path Partition Conjecture for Semicomplete and Acyclic Compositions
Jiangdong Ai, Stefanie Gerke, Gregory Gutin +1
Let be a digraph and let denote the number of vertices in a longest path of . For a pair of vertex-disjoint induced subdigraphs and of , we say that $(A,B)…
Kings in Multipartite Hypertournaments
Jiangdong Ai, Stefanie Gerke, Gregory Gutin
In his paper "Kings in Bipartite Hypertournaments" (Graphs Combinatorics 35, 2019), Petrovic stated two conjectures on 4-kings in multipartite hypertournaments. We prove one o…