Li, Xueliang (1958- ).
Li, Xueliang
Li, X. (Xueliang), 1958-
Li, X.
리쉐량 1958-
Xueliang Li Ph.D. Universiteit Twente 1991
李, 学良
VIAF ID: 107365656 ( Personal )
Permalink: http://viaf.org/viaf/107365656
Preferred Forms
-
- 100 1 _ ‡a Li, X.
-
-
- 100 1 _ ‡a Li, X. ‡q (Xueliang), ‡d 1958-
- 100 1 _ ‡a Li, Xueliang
- 100 1 _ ‡a Li, Xueliang
-
-
- 100 0 _ ‡a Xueliang Li ‡c Ph.D. Universiteit Twente 1991
- 100 1 _ ‡a 李, 学良
- 100 1 _ ‡a 리쉐량 ‡d 1958-
4xx's: Alternate Name Forms (21)
5xx's: Related Names (2)
- 510 2 _ ‡a Nankai University ‡b Center for Combinatorics ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Qinghai Normal University ‡b School of Mathematics and Statistics ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
Works
Title | Sources |
---|---|
The connectivity of the leaf-exchange spanning tree graph of a graph | |
Discrete Geometry, Combinatorics and Graph Theory : 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Revised Selected Papers | |
Energies of graphs : theory and applications | |
Graph energy | |
Graph polynomials | |
Graphs with large generalized (edge-)connectivity | |
Hamiltonicity of a type of interchange graphs | |
Hard graphs for the maximum clique problem II | |
Heavy paths and cycles in weighted graphs | |
Isomorphisms and traversability of directed path graphs | |
Minimum basis graphs of weighted matroids | |
N-Dimensional line digraphs | |
A proof of Balinski and Russakoff's conjecture on the connectivity of assignment polytope | |
Rainbow connections of graphs | |
Rainbow subgraphs and properly colored subgraphs in colored graphs | |
Some approaches to a conjecture on short cycles in digraphs | |
Sous-graphes arc-en-ciel et sous-graphes correctement colorés dans les graphes colorés. | |
Spanning trees with many or few colors in edge-colored graphs, 1995: | |
The Steiner Wiener index of a graph | |
Sufficient condition for dominating cliques | |
Transformation graphs | |
Words graphs: the first set |