| |
李学良
List of publications from the DBLP Bibliography Server - FAQ
| 2009 | ||
|---|---|---|
| 75 | EE | Xueliang Li, Xiangmei Yao, Wenli Zhou, Hajo Broersma: Complexity of conditional colorability of graphs. Appl. Math. Lett. 22(3): 320-324 (2009) |
| 2008 | ||
| 74 | EE | Xueliang Li, Chao Wang, Xiaoyan Zhang: The general sigma all-ones problem for trees. Discrete Applied Mathematics 156(10): 1790-1801 (2008) |
| 73 | EE | He Chen, Zemin Jin, Xueliang Li, Jianhua Tu: Heterochromatic tree partition numbers for complete bipartite graphs. Discrete Mathematics 308(17): 3871-3878 (2008) |
| 72 | EE | Zemin Jin, Xueliang Li: Graphs with the second largest number of maximal independent sets. Discrete Mathematics 308(23): 5864-5870 (2008) |
| 71 | EE | Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still: Some families of integral graphs. Discrete Mathematics 308(24): 6383-6391 (2008) |
| 70 | EE | Xueliang Li, Jianhua Tu: NP-completeness of 4-incidence colorability of semi-cubic graphs. Discrete Mathematics 308(7): 1334-1340 (2008) |
| 69 | EE | Ruihu Li, Xueliang Li: Binary construction of quantum codes of minimum distances five and six. Discrete Mathematics 308(9): 1603-1611 (2008) |
| 68 | EE | Ruihu Li, Zongben Xu, Xueliang Li: Standard Forms of Stabilizer and Normalizer Matrices for Additive Quantum Codes. IEEE Transactions on Information Theory 54(8): 3775-3778 (2008) |
| 67 | EE | Xueliang Li, Wenli Zhou: The 2nd-order conditional 3-coloring of claw-free graphs. Theor. Comput. Sci. 396(1-3): 151-157 (2008) |
| 2007 | ||
| 66 | Jin Akiyama, William Y. C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu: Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi'an, China, November 22-24, 2005, Revised Selected Papers Springer 2007 | |
| 65 | EE | Xueliang Li, Xiangmei Yao, Wenli Zhou: Complexity of the conditional colorability of graphs CoRR abs/0711.2843: (2007) |
| 64 | EE | Xueliang Li, Wenli Zhou: Dynamic 3-Coloring of Claw-free Graphs CoRR abs/0711.2844: (2007) |
| 63 | EE | Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still: Integral trees of diameter 6. Discrete Applied Mathematics 155(10): 1254-1266 (2007) |
| 62 | EE | Xueliang Li, Yongtang Shi: Corrections of proofs for Hansen and Mélot's two theorems. Discrete Applied Mathematics 155(17): 2365-2370 (2007) |
| 61 | EE | Yumei Hu, Xueliang Li, Yongtang Shi, Tianyi Xu: Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index. Discrete Applied Mathematics 155(8): 1044-1054 (2007) |
| 60 | EE | He Chen, Xueliang Li: Color Neighborhood Union Conditions for Long Heterochromatic Paths in Edge-Colored Graphs. Electr. J. Comb. 14(1): (2007) |
| 59 | EE | Xueliang Li, Xiaoyan Zhang: On the minimum monochromatic or multicolored subgraph partition problems. Theor. Comput. Sci. 385(1-3): 1-10 (2007) |
| 58 | EE | Hajo Broersma, Xueliang Li: On the complexity of dominating set problems related to the minimum all-ones problem. Theor. Comput. Sci. 385(1-3): 60-70 (2007) |
| 2006 | ||
| 57 | EE | Fengwei Li, Xueliang Li: The neighbor-scattering number can be computed in polynomial time for interval graphs CoRR abs/cs/0603069: (2006) |
| 56 | EE | Xueliang Li, Jianhua Tu: NP-completeness of 4-incidence colorability of semi-cubic graphs CoRR abs/math/0607071: (2006) |
| 55 | EE | Zemin Jin, Mikio Kano, Xueliang Li, Bing Wei: Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. J. Comb. Optim. 11(4): 445-454 (2006) |
| 54 | EE | Zemin Jin, Xueliang Li: On the k-path cover problem for cacti. Theor. Comput. Sci. 355(3): 354-363 (2006) |
| 2005 | ||
| 53 | EE | Genjiu Xu, Xueliang Li, Shenggui Zhang: The Binding Number of a Digraph. CJCDGCGT 2005: 221-227 |
| 52 | EE | Lin Hu, Xueliang Li: Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs. CJCDGCGT 2005: 47-58 |
| 51 | EE | Fengwei Li, Xueliang Li: Computational complexity and bounds for neighbor-scattering number of graphs. ISPAN 2005: 478-483 |
| 50 | EE | William Y. C. Chen, Xueliang Li, Jie Zheng: Matrix method for linear sequential dynamical systems on digraphs. Applied Mathematics and Computation 160(1): 197-212 (2005) |
| 49 | Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo: Two Approaches for the Generalization of Leaf Edge Exchange Graphs on Spanning Trees to Connected Spanning k-Edge Subgraphs of a Graph. Ars Comb. 75: (2005) | |
| 48 | Ligong Wang, Xueliang Li, Cornelis Hoede: Two Classes of Integral Regular Graphs. Ars Comb. 76: (2005) | |
| 47 | EE | Haixing Zhao, Xueliang Li, Ruying Liu: On problems and conjectures on adjointly equivalent graphs. Discrete Mathematics 295(1-3): 203-212 (2005) |
| 46 | EE | Ligong Wang, Xueliang Li: Integral trees with diameters 5 and 6. Discrete Mathematics 297(1-3): 128-143 (2005) |
| 45 | EE | He Chen, Xueliang Li: Long Heterochromatic Paths in Edge-Colored Graphs. Electr. J. Comb. 12: (2005) |
| 44 | EE | Yinkui Li, Shenggui Zhang, Xueliang Li: Rupture degree of graphs. Int. J. Comput. Math. 82(7): 793-803 (2005) |
| 43 | EE | Xueliang Li, Wenan Zang: A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs. J. Comb. Optim. 9(4): 331-347 (2005) |
| 2004 | ||
| 42 | EE | Fengwei Li, Xueliang Li: Computing the Rupture Degrees of Graphs. ISPAN 2004: 368-373 |
| 41 | EE | Ligong Wang, Xueliang Li, Shenggui Zhang: Families of integral trees with diameters 4, 6, and 8. Discrete Applied Mathematics 136(2-3): 349-362 (2004) |
| 40 | EE | Haixing Zhao, Xueliang Li, Shenggui Zhang, Ruying Liu: On the minimum real roots of the -polynomials and chromatic uniqueness of graphs. Discrete Mathematics 281(1-3): 277-294 (2004) |
| 39 | EE | Ligong Wang, Xueliang Li, Cornelis Hoede: Integral complete r-partite graphs. Discrete Mathematics 283(1-3): 231-241 (2004) |
| 38 | EE | Liming Xiong, Hajo Broersma, Xueliang Li, MingChu Li: The hamiltonian index of a graph and its branch-bonds. Discrete Mathematics 285(1-3): 279-288 (2004) |
| 37 | EE | Jichang Wu, Xueliang Li, Lusheng Wang: Removable edges in a cycle of a 4-connected graph. Discrete Mathematics 287(1-3): 103-111 (2004) |
| 36 | EE | Xueliang Li, Biao Zhao: Isomorphisms of Pk-graphs for kge4. Discrete Mathematics 289(1-3): 71-80 (2004) |
| 35 | EE | William Y. C. Chen, Xueliang Li, Chao Wang, Xiaoyan Zhang: Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs. Electronic Notes in Discrete Mathematics 17: 93-98 (2004) |
| 34 | EE | Jichang Wu, Xueliang Li: Removable Edges in Longest Cycles of 4-Connected Graphs. Graphs and Combinatorics 20(3): 413-422 (2004) |
| 33 | EE | Haixing Zhao, Xueliang Li, Ruying Liu, Chengfu Ye: The Chromaticity of Certain Complete Multipartite Graphs. Graphs and Combinatorics 20(3): 423-434 (2004) |
| 32 | Ruihu Li, Xueliang Li: Binary Construction of Quantum Codes of Minimum Distance Three and Four. IEEE Transactions on Information Theory 50(6): 1331-1336 (2004) | |
| 31 | EE | Zemin Jin, Xueliang Li: The complexity for partitioning graphs by monochromatic trees, cycles and paths. Int. J. Comput. Math. 81(11): 1357-1362 (2004) |
| 30 | EE | Jichang Wu, Xueliang Li, Jianji Su: The number of removable edges in a 4-connected graph. J. Comb. Theory, Ser. B 92(1): 13-40 (2004) |
| 29 | EE | William Y. C. Chen, Xueliang Li, Chao Wang, Xiaoyan Zhang: The Minimum All-Ones Problem for Trees. SIAM J. Comput. 33(2): 379-392 (2004) |
| 2003 | ||
| 28 | EE | Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo: On a tree graph defined by a set of cycles. Discrete Mathematics 271(1-3): 303-310 (2003) |
| 27 | Xueliang Li, Zimao Li, Lusheng Wang: The Inverse Problems for Some Topological Indices in Combinatorial Chemistry. Journal of Computational Biology 10(1): 47-56 (2003) | |
| 26 | EE | Xueliang Li, Lusheng Wang: Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids. SIAM J. Discrete Math. 17(2): 210-218 (2003) |
| 2002 | ||
| 25 | Hajo Broersma, Xueliang Li: Some approaches to a conjecture on short cycles in digraphs. Discrete Applied Mathematics 120(1-3): 45-53 (2002) | |
| 24 | EE | Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li: Degree sums and subpancyclicity in line graphs. Discrete Mathematics 242(1-3): 255-267 (2002) |
| 23 | EE | Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang: A Fan Type Condition For Heavy Cycles in Weighted Graphs. Graphs and Combinatorics 18(1): 193-200 (2002) |
| 22 | EE | Shenggui Zhang, Xueliang Li, Xinglou Han: Computing the Scattering Number of Graphs. Int. J. Comput. Math. 79(2): 179-187 (2002) |
| 2001 | ||
| 21 | EE | Ligong Wang, Xueliang Li, Shenggui Zhang: Some New Families of Integral Trees with Diameters 4 and 6. Electronic Notes in Discrete Mathematics 8: 119-123 (2001) |
| 20 | EE | Xueliang Li, Shenggui Zhang, Hajo Broersma: Paths and Cycles in Colored Graphs. Electronic Notes in Discrete Mathematics 8: 128-132 (2001) |
| 2000 | ||
| 19 | EE | Shenggui Zhang, Xueliang Li, Hajo Broersma: Heavy paths and cycles in weighted graphs. Discrete Mathematics 223(1-3): 327-336 (2000) |
| 1999 | ||
| 18 | EE | Ligong Wang, Xueliang Li, Ruying Liu: Integral Trees With Diameter 6 or 8. Electronic Notes in Discrete Mathematics 3: 208-213 (1999) |
| 1998 | ||
| 17 | Xueliang Li: On the Determination Problem for P3-Transformation of Graphs. Ars Comb. 49: (1998) | |
| 16 | EE | Hortensia Galeana-Sánchez, Xueliang Li: Kernels in a special class of digraphs. Discrete Mathematics 178(1-3): 73-80 (1998) |
| 15 | EE | Xueliang Li: The connectivity of the SEE-graph and AEE-graph for the connected spanning k-edge subgraphs of a graph. Discrete Mathematics 183(1-3): 237-245 (1998) |
| 14 | EE | Xueliang Li: Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem. Discrete Mathematics 188(1-3): 175-182 (1998) |
| 13 | EE | Hortensia Galeana-Sánchez, Xueliang Li: Semikernels and (k, l)-Kernels in Digraphs. SIAM J. Discrete Math. 11(2): 340-346 (1998) |
| 1997 | ||
| 12 | EE | Xueliang Li: Hexagonal Systems with Forcing Single Edges. Discrete Applied Mathematics 72(3): 295-301 (1997) |
| 11 | EE | Xueliang Li: A lower bound for the connectivity of directed Euler tour transformation graphs. Discrete Mathematics 163(1-3): 101-108 (1997) |
| 1996 | ||
| 10 | Hajo Broersma, Xueliang Li: The connectivity of the leaf-exchange spanning tree graph of a graph. Ars Comb. 43: (1996) | |
| 9 | EE | Xueliang Li, Heping Zhang: A solution to Gutman's problem on the characteristic polynomial of a bipartite graph. Discrete Mathematics 154(1-3): 297-300 (1996) |
| 1995 | ||
| 8 | EE | Xueliang Li, Ivan Gutman: A Unified Approach to the First Derivatives of Graph Polynomials. Discrete Applied Mathematics 58(3): 293-297 (1995) |
| 7 | EE | Fuji Zhang, Xueliang Li: Hexagonal systems with forcing edges. Discrete Mathematics 140(1-3): 253-263 (1995) |
| 1994 | ||
| 6 | EE | Xueliang Li, Fuji Zhang: Hamiltonicity of a Type of Interchange Graphs. Discrete Applied Mathematics 51(1-2): 107-111 (1994) |
| 5 | EE | Cornelis Hoede, Xueliang Li: Clique polynomials and independent set polynomials of graphs. Discrete Mathematics 125(1-3): 219-228 (1994) |
| 4 | EE | Xueliang Li, Fuji Zhang: n-Dimensional line graphs. Discrete Mathematics 132(1-3): 127-135 (1994) |
| 1993 | ||
| 3 | EE | Hajo Broersma, Xueliang Li: On "The Matching Polynomial of a Polygraph". Discrete Applied Mathematics 46(1): 79-86 (1993) |
| 2 | EE | Fuji Zhang, Xueliang Li, Heping Zhang: Hexagonal Systems with Fixed Bonds. Discrete Applied Mathematics 47(3): 285-296 (1993) |
| 1991 | ||
| 1 | EE | Xueliang Li, Fuji Zhang: On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs. Discrete Mathematics 94(3): 189-197 (1991) |