supported by National Natural Science Foundation of China(Grant Nos.62172446,61872450)。
Triangle packing problem has been paid lots of attention to in the literature.In this paper,we study the kernelization of the triangle packing problem in tournaments.For the parameterized arc-disjoint triangle packing...
Several possible definitions of local injectivity for a homomorphism of an oriented graph G to an oriented graph H are considered. In each case, we determine the complexity of deciding whether there exists such a homo...
supported by the National Natural Science Foundation of China(Nos.12071260,11671232)。
A tournament is an orientation of the complete graph.Tournaments form perhaps the most interesting class of digraphs and it has a great potential for application.Tournaments provide a model of the statistical techniqu...
This paper gives integer linear programming models for scheduling doubles tennis group competitions. The goal is to build a fair and competitive schedule for all players. Our basic model achieves that for each player ...
supported by the Natural Science Young Foundation of China(No.11701349);by the Natural Science Foundation of Shanxi Province,China(No.201601D011005);by Shanxi Scholarship Council of China(2017-018)
Gutin and Rafiey(Australas J. Combin. 34(2006), 17-21) provided an example of an n-partite tournament with exactly n-m + 1 cycles of length of m for any given m with 4 ≤ m ≤ n, and posed the following question....
Supported by the National Natural Science Foundation of China(No.11731002);the Fundamental Research Funds for the Central Universities(Nos.2016JBM071,2016JBZ012)
An embedding of a digraph in an orientable surface is an embedding as the underlying graph and arcs in each region force a directed cycle. The directed genus is the minimum genus of surfaces in which the digraph can b...
partially supported by NNSFC(Grant No.11401353);TYAL of Shanxi and NSF of Shanxi Province(Grant No.2016011005);partially supported by China Scholarship Council
In 2006, Sullivan stated the conjectures: (1) every oriented graph has a vertex x such that d++ (x) ≥ d- (x); (2) every oriented graph has a vertex x such that d++ (x) + d+ (x) ≥ 2d- (x); (3) ...
Purpose: Ramanujacharyulu developed the Power-weakness Ratio (PWR) for scoring tournaments. The PWR algorithm has been advocated (and used) for measuring the impact of journals. We show how such a newly proposed ...
In this paper, we generate all nonisomorphic tournaments of order at mostnine, all nonisomorphic almost regular tournaments of order 10 and all nonisomorphic regulartournaments of order 11. For each of these tournamen...