The following pages link to Yue-Li Wang (Q255279):
Displayed 41 items.
- A note on the geodetic number and the Steiner number of AT-free graphs (Q2220867) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- Incidence coloring of Cartesian product graphs (Q2348706) (← links)
- Resequencing a set of strings based on a target string (Q2354022) (← links)
- Construction independent spanning trees on locally twisted cubes in parallel (Q2359799) (← links)
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
- Edit distance for a run-length-encoded string and an uncompressed string (Q2380032) (← links)
- Geodesic-pancyclic graphs (Q2381818) (← links)
- The existence and uniqueness of strong kings in tournaments (Q2427527) (← links)
- The lower and upper forcing geodetic numbers of block--cactus graphs (Q2432848) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- A tight upper bound for 2-rainbow domination in generalized Petersen graphs (Q2446862) (← links)
- Finding a longest common subsequence between a run-length-encoded string and an uncompressed string (Q2483205) (← links)
- The hub number of co-comparability graphs (Q2514123) (← links)
- On Independence Domination (Q2842784) (← links)
- On Retracts, Absolute Retracts, and Folds in Cographs (Q2864312) (← links)
- On Complexities of Minus Domination (Q2867118) (← links)
- The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs (Q2898008) (← links)
- Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs (Q2914320) (← links)
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs (Q3157040) (← links)
- Sequence Alignment Algorithms for Run-Length-Encoded Strings (Q3511343) (← links)
- Geodetic Contraction Games on Trees (Q4632218) (← links)
- (Q4818472) (← links)
- On efficient absorbant conjecture in generalized De Bruijn digraphs (Q4976295) (← links)
- CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2<sup>m</sup>, 2) (Q5187853) (← links)
- The 2-rainbow bondage number in generalized Petersen graphs (Q5193416) (← links)
- Edge-Clique Covers of the Tensor Product (Q5251635) (← links)
- A New Subclass of Integer Linear Programming Problems and Its Applications (Q5274590) (← links)
- Independent Spanning Trees on Multidimensional Torus Networks (Q5280831) (← links)
- An efficient algorithm for estimating rotation distance between two binary trees (Q5312707) (← links)
- On Perfect Absorbants in De Bruijn Digraphs (Q5405942) (← links)
- (Q5412227) (← links)
- Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio (Q5746261) (← links)
- The Outer-Paired Domination of Graphs (Q6114861) (← links)
- A note on "Folding wheels and fans." (Q6235682) (← links)
- The Domination Number of Generalized Petersen Graphs with a Faulty Vertex (Q6241717) (← links)
- Independent set in categorical products of cographs and splitgraphs (Q6242008) (← links)
- Set Representations of Linegraphs (Q6244471) (← links)
- P_3-Games on Chordal Bipartite Graphs (Q6278916) (← links)
- On the Orbits of Crossed Cubes (Q6289276) (← links)