The SCEAS System
| |||||||

## Search the dblp DataBase
Xueliang Li:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Fengwei Li, Xueliang Li
**Computing the Rupture Degrees of Graphs.**[Citation Graph (0, 0)][DBLP] ISPAN, 2004, pp:368-373 [Conf] - Hajo Broersma, Xueliang Li
**The connectivity of the leaf-exchange spanning tree graph of a graph.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1996, v:43, n:, pp:- [Journal] - Xueliang Li
**On the Determination Problem for P3-Transformation of Graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1998, v:49, n:, pp:- [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2005, v:75, n:, pp:- [Journal] - Ligong Wang, Xueliang Li, Cornelis Hoede
**Two Classes of Integral Regular Graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2005, v:76, n:, pp:- [Journal] - Hajo Broersma, Xueliang Li
**Some approaches to a conjecture on short cycles in digraphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:45-53 [Journal] - Hajo Broersma, Xueliang Li
**On "The Matching Polynomial of a Polygraph".**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:46, n:1, pp:79-86 [Journal] - Xueliang Li
**Hexagonal Systems with Forcing Single Edges.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:72, n:3, pp:295-301 [Journal] - Xueliang Li, Ivan Gutman
**A Unified Approach to the First Derivatives of Graph Polynomials.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:58, n:3, pp:293-297 [Journal] - Xueliang Li, Fuji Zhang
**Hamiltonicity of a Type of Interchange Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:107-111 [Journal] - Ligong Wang, Xueliang Li, Shenggui Zhang
**Families of integral trees with diameters 4, 6, and 8.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:349-362 [Journal] - Fuji Zhang, Xueliang Li, Heping Zhang
**Hexagonal Systems with Fixed Bonds.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:47, n:3, pp:285-296 [Journal] - Yumei Hu, Xueliang Li, Yongtang Shi, Tianyi Xu
**Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:8, pp:1044-1054 [Journal] - Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still
**Integral trees of diameter 6.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:10, pp:1254-1266 [Journal] - Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo
**On a tree graph defined by a set of cycles.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:271, n:1-3, pp:303-310 [Journal] - Xueliang Li, Biao Zhao
**Isomorphisms of**[Citation Graph (0, 0)][DBLP]*P*-graphs for_{k}*k*ge4. Discrete Mathematics, 2004, v:289, n:1-3, pp:71-80 [Journal] - Ligong Wang, Xueliang Li
**Integral trees with diameters 5 and 6.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:297, n:1-3, pp:128-143 [Journal] - Ligong Wang, Xueliang Li, Cornelis Hoede
**Integral complete r-partite graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:283, n:1-3, pp:231-241 [Journal] - Jichang Wu, Xueliang Li, Lusheng Wang
**Removable edges in a cycle of a 4-connected graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:287, n:1-3, pp:103-111 [Journal] - Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li
**Degree sums and subpancyclicity in line graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:242, n:1-3, pp:255-267 [Journal] - Liming Xiong, Hajo Broersma, Xueliang Li, MingChu Li
**The hamiltonian index of a graph and its branch-bonds.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:285, n:1-3, pp:279-288 [Journal] - Shenggui Zhang, Xueliang Li, Hajo Broersma
**Heavy paths and cycles in weighted graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:223, n:1-3, pp:327-336 [Journal] - Haixing Zhao, Xueliang Li, Ruying Liu
**On problems and conjectures on adjointly equivalent graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:295, n:1-3, pp:203-212 [Journal] - Haixing Zhao, Xueliang Li, Shenggui Zhang, Ruying Liu
**On the minimum real roots of the -polynomials and chromatic uniqueness of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:281, n:1-3, pp:277-294 [Journal] - Jichang Wu, Xueliang Li
**Removable Edges in Longest Cycles of 4-Connected Graphs.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2004, v:20, n:3, pp:413-422 [Journal] - Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang
**A Fan Type Condition For Heavy Cycles in Weighted Graphs.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2002, v:18, n:1, pp:193-200 [Journal] - Haixing Zhao, Xueliang Li, Ruying Liu, Chengfu Ye
**The Chromaticity of Certain Complete Multipartite Graphs.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2004, v:20, n:3, pp:423-434 [Journal] - Yinkui Li, Shenggui Zhang, Xueliang Li
**Rupture degree of graphs.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Math., 2005, v:82, n:7, pp:793-803 [Journal] - Shenggui Zhang, Xueliang Li, Xinglou Han
**Computing the Scattering Number of Graphs.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Math., 2002, v:79, n:2, pp:179-187 [Journal] - Zemin Jin, Xueliang Li
**The complexity for partitioning graphs by monochromatic trees, cycles and paths.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Math., 2004, v:81, n:11, pp:1357-1362 [Journal] - Xueliang Li, Zimao Li, Lusheng Wang
**The Inverse Problems for Some Topological Indices in Combinatorial Chemistry.**[Citation Graph (0, 0)][DBLP] Journal of Computational Biology, 2003, v:10, n:1, pp:47-56 [Journal] - Xueliang Li, Wenan Zang
**A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2005, v:9, n:4, pp:331-347 [Journal] - Zemin Jin, Mikio Kano, Xueliang Li, Bing Wei
**Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2006, v:11, n:4, pp:445-454 [Journal] - Jichang Wu, Xueliang Li, Jianji Su
**The number of removable edges in a 4-connected graph.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2004, v:92, n:1, pp:13-40 [Journal] - William Y. C. Chen, Xueliang Li, Chao Wang, Xiaoyan Zhang
**The Minimum All-Ones Problem for Trees.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:33, n:2, pp:379-392 [Journal] - Hortensia Galeana-Sánchez, Xueliang Li
**Semikernels and (**[Citation Graph (0, 0)][DBLP]*k, l*)-Kernels in Digraphs. SIAM J. Discrete Math., 1998, v:11, n:2, pp:340-346 [Journal] - Xueliang Li, Lusheng Wang
**Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2003, v:17, n:2, pp:210-218 [Journal] - Zemin Jin, Xueliang Li
**On the**[Citation Graph (0, 0)][DBLP]*k*-path cover problem for cacti. Theor. Comput. Sci., 2006, v:355, n:3, pp:354-363 [Journal] - Ruihu Li, Xueliang Li
**Binary Construction of Quantum Codes of Minimum Distance Three and Four.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:1331-1336 [Journal] - Lin Hu, Xueliang Li
**Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs.**[Citation Graph (0, 0)][DBLP] CJCDGCGT, 2005, pp:47-58 [Conf] - Genjiu Xu, Xueliang Li, Shenggui Zhang
**The Binding Number of a Digraph.**[Citation Graph (0, 0)][DBLP] CJCDGCGT, 2005, pp:221-227 [Conf] - Fengwei Li, Xueliang Li
**The neighbor-scattering number can be computed in polynomial time for interval graphs**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Xueliang Li, Jianhua Tu
**NP-completeness of 4-incidence colorability of semi-cubic graphs**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Xueliang Li, Yongtang Shi
**Corrections of proofs for Hansen and Mélot's two theorems.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:17, pp:2365-2370 [Journal] - Xueliang Li
**The connectivity of the SEE-graph and AEE-graph for the connected spanning k-edge subgraphs of a graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:183, n:1-3, pp:237-245 [Journal] - Xueliang Li
**Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:188, n:1-3, pp:175-182 [Journal] - Hortensia Galeana-Sánchez, Xueliang Li
**Kernels in a special class of digraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:178, n:1-3, pp:73-80 [Journal] - Xueliang Li
**A lower bound for the connectivity of directed Euler tour transformation graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:163, n:1-3, pp:101-108 [Journal] - Xueliang Li, Fuji Zhang
**On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:94, n:3, pp:189-197 [Journal] - Xueliang Li, Heping Zhang
**A solution to Gutman's problem on the characteristic polynomial of a bipartite graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:154, n:1-3, pp:297-300 [Journal] - Xueliang Li, Fuji Zhang
**n-Dimensional line graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:132, n:1-3, pp:127-135 [Journal] - Fuji Zhang, Xueliang Li
**Hexagonal systems with forcing edges.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:140, n:1-3, pp:253-263 [Journal] - Cornelis Hoede, Xueliang Li
**Clique polynomials and independent set polynomials of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:125, n:1-3, pp:219-228 [Journal] - Hajo Broersma, Xueliang Li
**On the complexity of dominating set problems related to the minimum all-ones problem.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:385, n:1-3, pp:60-70 [Journal] - Xueliang Li, Xiaoyan Zhang
**On the minimum monochromatic or multicolored subgraph partition problems.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:385, n:1-3, pp:1-10 [Journal] **Computational complexity and bounds for neighbor-scattering number of graphs.**[Citation Graph (, )][DBLP]**Weighted Lee Algorithm on Rectilinear Steiner Tree with Obstacles and Boundary.**[Citation Graph (, )][DBLP]**Complexity of conditional colorability of graphs.**[Citation Graph (, )][DBLP]**The rainbow number of matchings in regular bipartite graphs.**[Citation Graph (, )][DBLP]**Long Heterochromatic Paths in Edge-Colored Graphs.**[Citation Graph (, )][DBLP]**Color Neighborhood Union Conditions for Long Heterochromatic Paths in Edge-Colored Graphs.**[Citation Graph (, )][DBLP]**Complexity of the conditional colorability of graphs**[Citation Graph (, )][DBLP]**Dynamic 3-Coloring of Claw-free Graphs**[Citation Graph (, )][DBLP]**The rainbow k-connectivity of two classes of graphs**[Citation Graph (, )][DBLP]**The asymptotic value of Randic index for trees**[Citation Graph (, )][DBLP]**The asymptotic values of the general Zagreb and Randić indices of trees with bounded maximum degree**[Citation Graph (, )][DBLP]**Note on the Rainbow $k$-Connectivity of Regular Complete Bipartite Graphs**[Citation Graph (, )][DBLP]**Hardness results on generalized connectivity**[Citation Graph (, )][DBLP]**The general sigma all-ones problem for trees.**[Citation Graph (, )][DBLP]**On bipartite graphs with minimal energy.**[Citation Graph (, )][DBLP]**A proof of a conjecture on the Randic index of graphs with given girth.**[Citation Graph (, )][DBLP]**Binary construction of quantum codes of minimum distances five and six.**[Citation Graph (, )][DBLP]**NP-completeness of 4-incidence colorability of semi-cubic graphs.**[Citation Graph (, )][DBLP]**Heterochromatic tree partition numbers for complete bipartite graphs.**[Citation Graph (, )][DBLP]**Graphs with the second largest number of maximal independent sets.**[Citation Graph (, )][DBLP]**Some families of integral graphs.**[Citation Graph (, )][DBLP]**Bipartite rainbow numbers of matchings.**[Citation Graph (, )][DBLP]**Complete solution for the rainbow numbers of matchings.**[Citation Graph (, )][DBLP]**Complete solution to a conjecture on the Randic index of triangle-free graphs.**[Citation Graph (, )][DBLP]**Trees with a given order and matching number that have maximum general Randic index.**[Citation Graph (, )][DBLP]**On a relation between the Randic index and the chromatic number.**[Citation Graph (, )][DBLP]**Sharp bounds for the generalized connectivity kappa**[Citation Graph (, )][DBLP]_{3}(G).
Search in 0.070secs, Finished in 0.074secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |