97 citations · 315 across the 126 of their papers we have counts for
143 papers
The Complexity of Mixed Arc-Disjoint Spanning Subdigraphs with Antistrong Connectivity
Jiangdong Ai, Gregory Gutin, Hui Lei +1
A trail is antidirected if its arcs alternate between forward and backward. A digraph is antistrong if, for every ordered pair of distinct vertices , it contains a…
Edge-chromatic -critical graphs and Overfull Conjecture for graphs with maximum degree
Chunhui Ge, Gregory Gutin, Xuli Qi
Let be a simple graph with maximum degree and chromatic index . A graph is called edge-chromatic -critical if and for every p…
Weighted Counting Formula and Lower Bound for Induced Subgraphs with Prescribed Degree Parities
Gregory Gutin, Yiming Hao, Yacong Zhou
Let be a finite simple graph of order , and let be a prescribed parity labeling. A set is called -admissible if $d_S(v)\e…
Feedback vertex sets of digraphs with bounded maximum degree
Jiangdong Ai, Gregory Gutin, Xiangzhou Liu +2
A digraph is an oriented graph if does not have a pair of opposite arcs. The degree of a vertex of is the sum of the in-degree and out-degree of Let b…
Odd Induced Subgraphs in Graphs of Maximum Degree Four
Jiangdong Ai, Qiwen Guo, Gregory Gutin +2
A graph is called odd if all of its vertex degrees are odd. A long-standing conjecture asked whether there exists a positive constant such that every -vertex graph without i…
Public Goods Games in Directed Networks with Constraints on Sharing
Argyrios Deligkas, Gregory Gutin, Mark Jones +2
In a public goods game, every player chooses whether or not to buy a good that all neighboring players will have access to. We consider a setting in which the good is indivisible,…