7 citations · 33 across the 43 of their papers we have counts for
5 papers · 1 filter
The Erdős-Gyárfás function with respect to Gallai-colorings
Xihe Li, Hajo Broersma, Ligong Wang
For fixed and , an edge-coloring of the complete graph is said to be a -coloring if every receives at least distinct colors. The function $f(n, p, q)…
The generalized Turán number of spanning linear forests
Lin-Peng Zhang, Ligong Wang, Jiale Zhou
Let be a family of graphs. A graph is called \textit{-free} if for any , there is no subgraph of isomorphic to . Given a gra…
The bounds of the spectral radius of general hypergraphs in terms of clique number
Cunxiang Duan, Ligong Wang
The spectral radius (or the signless Laplacian spectral radius) of a general hypergraph is the maximum modulus of the eigenvalues of its adjacency (or its signless Laplacian) tenso…
Extremal problems and results related to Gallai-colorings
Xihe Li, Hajo Broersma, Ligong Wang
A Gallai-coloring (Gallai--coloring) is an edge-coloring (with colors from ) of a complete graph without rainbow triangles. Given a graph and a positive…
Iota energy orderings of bicyclic signed digraphs
Xiuwen Yang, Ligong Wang
The concept of energy of a signed digraph is extended to iota energy of a signed digraph. The energy of a signed digraph is defined by , wher…