The following pages link to Li-ying Kang (Q1598802):
Displaying 50 items.
- Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times (Q1634027) (← links)
- Trees with unique least central subtrees (Q1649916) (← links)
- Extremal hypergraphs for matching number and domination number (Q1693167) (← links)
- The 2-median problem on cactus graphs with positive and negative weights (Q1699788) (← links)
- The spectral radius and domination number of uniform hypergraphs (Q1708619) (← links)
- Bounds on the spectral radius of uniform hypergraphs (Q1735687) (← links)
- Circuit decompositions and shortest circuit coverings of hypergraphs (Q1743689) (← links)
- On the irregularity of uniform hypergraphs (Q1750206) (← links)
- Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees (Q1753081) (← links)
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four (Q1756039) (← links)
- Batch-processing scheduling with setup times (Q1768605) (← links)
- Paired-domination of trees (Q1810885) (← links)
- A note on balance vertices in trees (Q1827688) (← links)
- Online scheduling on uniform machines with two hierarchies (Q1928505) (← links)
- The independence number of connected (claw, \(K_4\))-free 4-regular graphs (Q1949035) (← links)
- Online scheduling of parallel jobs with preemption on two identical machines (Q1949689) (← links)
- The matching polynomials and spectral radii of uniform supertrees (Q1991421) (← links)
- The extremal \(\alpha \)-index of outerplanar and planar graphs (Q2008179) (← links)
- Decomposing uniform hypergraphs into uniform hypertrees and single edges (Q2032883) (← links)
- On a conjecture for power domination (Q2042204) (← links)
- Turán problems for Berge-\((k, p)\)-fan hypergraph (Q2047221) (← links)
- The spectral radius and domination number in linear uniform hypergraphs (Q2051910) (← links)
- The average tree value for hypergraph games (Q2074839) (← links)
- Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs (Q2075528) (← links)
- Spectral extremal graphs for intersecting cliques (Q2125679) (← links)
- Solution to a forcible version of a graphic sequence problem (Q2141340) (← links)
- The Turán number of Berge-matching in hypergraphs (Q2142638) (← links)
- Power domination in the generalized Petersen graphs (Q2175230) (← links)
- Extremal graphs for odd-ballooning of paths and cycles (Q2175804) (← links)
- Extremal problems for the \(p\)-spectral radius of Berge hypergraphs (Q2180089) (← links)
- Saturation number of Berge stars in random hypergraphs (Q2215467) (← links)
- The extremal \(p\)-spectral radius of Berge hypergraphs (Q2228127) (← links)
- The principal eigenvector to \(\alpha\)-spectral radius of hypergraphs (Q2230731) (← links)
- Total restrained domination in claw-free graphs (Q2268763) (← links)
- The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers (Q2268861) (← links)
- The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number (Q2279754) (← links)
- The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
- Spectral radii of two kinds of uniform hypergraphs (Q2335791) (← links)
- Constructing the minimum dominating sets of generalized de Bruijn digraphs (Q2342640) (← links)
- Absorbant of generalized de Bruijn digraphs (Q2380030) (← links)
- The algorithmic complexity of the minus clique-transversal problem (Q2383654) (← links)
- The spectra of uniform hypertrees (Q2404964) (← links)
- Two efficient values of cooperative games with graph structure based on \(\tau\)-values (Q2410098) (← links)
- Matching and domination numbers in \(r\)-uniform hypergraphs (Q2410114) (← links)
- A characterization of box-bounded degree sequences of graphs (Q2413625) (← links)
- Maximally connected \(p\)-partite uniform hypergraphs (Q2422749) (← links)
- The eigenvectors to the \(p\)-spectral radius of general hypergraphs (Q2424826) (← links)
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs (Q2430322) (← links)
- Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
- On matching and total domination in graphs (Q2483421) (← links)