Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 338
Hong-Jian Lai - MaRDI portal

Hong-Jian Lai

From MaRDI portal
(Redirected from Person:702621)
Person:175486

Available identifiers

zbMath Open lai.hong-jianWikidataQ89865442 ScholiaQ89865442MaRDI QIDQ175486

List of research outcomes

PublicationDate of PublicationType
The list \(r\)-hued coloring of \(K_{m, n}\)2024-03-27Paper
Hamilton-connected claw-free graphs with Ore-degree conditions2023-11-13Paper
On hamiltonian line graphs of hypergraphs2023-10-05Paper
Induced subgraphs of product graphs and a generalization of Huang's theorem2023-10-04Paper
Square Coloring of Planar Graphs with Maximum Degree at Most Five2023-08-03Paper
Asymptotically sharpening the $s$-Hamiltonian index bound2023-05-30Paper
Gallai-Ramsey numbers involving a rainbow 4-path2023-05-26Paper
On Hamiltonian properties of \(K_{1, r}\)-free split graphs2023-05-15Paper
Fractional matching number and spectral radius of nonnegative matrices of graphs2023-04-13Paper
No mixed graph with the nullity $\eta(\widetilde{G})=|V(G)|-2m(G)+2c(G)-1$2023-04-12Paper
Weighted modulo orientations of graphs and signed graphs2023-01-11Paper
Spectral and extremal conditions for supereulerian graphs2023-01-05Paper
On list \(r\)-hued coloring of outer-1-planar graphs2022-12-07Paper
On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs2022-12-02Paper
Complete family reduction and spanning connectivity in line graphs2022-11-02Paper
https://portal.mardi4nfdi.de/entity/Q58669812022-09-22Paper
Graph \(r\)-hued colorings -- a survey2022-09-15Paper
Strengthened Ore conditions for \((s, t)\)-supereulerian graphs2022-08-24Paper
On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs2022-07-15Paper
On the \(s\)-hamiltonianicity of an hourglass-free line graph2022-05-27Paper
Hamiltonian index of directed multigraph2022-05-19Paper
Modulo orientations and matchings in graphs2022-05-17Paper
Hamiltonian line graphs with local degree conditions2022-04-11Paper
The extremal sizes of arc-maximal \((k, \ell)\)-digraphs2022-03-21Paper
A condition on Hamilton-connected line graphs2022-03-21Paper
On the extended Clark-Wormold Hamiltonian-like index problem2022-02-14Paper
On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs2022-01-13Paper
Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions2021-11-30Paper
Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube2021-11-10Paper
Multigraphic degree sequences and Hamiltonian-connected line graphs2021-11-04Paper
A Note on Group Colorings and Group Structure2021-11-04Paper
Polynomially determine if a graph is \((s,3)\)-supereulerian2021-09-30Paper
Matching and spanning trails in digraphs2021-09-30Paper
https://portal.mardi4nfdi.de/entity/Q33821992021-09-20Paper
https://portal.mardi4nfdi.de/entity/Q33822272021-09-20Paper
https://portal.mardi4nfdi.de/entity/Q33822322021-09-20Paper
Symmetric core and spanning trails in directed networks2021-09-06Paper
Catlin’s reduced graphs with small orders2021-09-01Paper
Edge-disjoint spanning trees and forests of graphs2021-05-31Paper
Polynomially determining spanning connectivity of locally connected line graphs2021-04-01Paper
Supereulerian graphs with constraints on the matching number and minimum degree2021-03-17Paper
Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs2021-03-17Paper
Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number2021-02-17Paper
Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs2021-02-16Paper
Connectivity and eigenvalues of graphs with given girth or clique number2021-02-12Paper
On \(( s , t )\)-supereulerian graphs with linear degree bounds2021-01-27Paper
On \(s\)-Hamiltonicity of net-free line graphs2021-01-21Paper
On the line graph of a graph with diameter 22021-01-21Paper
Chvátal-Erdős conditions and almost spanning trails2020-11-05Paper
On weighted modulo orientation of graphs2020-09-15Paper
Contractible graphs for flow index less than three2020-09-10Paper
On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs2020-08-31Paper
Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs2020-06-17Paper
https://portal.mardi4nfdi.de/entity/Q51090742020-05-07Paper
On the sizes of bi-\(k\)-maximal graphs2020-03-24Paper
Fractional matching number and spectral radius of nonnegative matrix of graphs2020-02-02Paper
On the permanental nullity and matching number of graphs2019-12-18Paper
https://portal.mardi4nfdi.de/entity/Q52063672019-12-18Paper
https://portal.mardi4nfdi.de/entity/Q52063982019-12-18Paper
https://portal.mardi4nfdi.de/entity/Q52064152019-12-18Paper
Vertex-connectivity and eigenvalues of graphs with fixed girth2019-11-25Paper
Spectral analogues of Erdős' theorem on Hamilton-connected graphs2019-11-22Paper
On the permanental sum of graphs2019-11-12Paper
On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs2019-11-06Paper
Generalized cospectral graphs with and without Hamiltonian cycles2019-11-04Paper
Characterizations of matroids with an element lying in a restricted number of circuits2019-10-29Paper
On \(s\)-Hamiltonian line graphs of claw-free graphs2019-09-11Paper
Vertex-connectivity and eigenvalues of graphs2019-09-10Paper
Spanning tree packing number and eigenvalues of graphs with given girth2019-08-29Paper
Spectral results on Hamiltonian problem2019-06-27Paper
On \(r\)-hued colorings of graphs without short induced paths2019-06-18Paper
Bounds for the matching number and cyclomatic number of a signed graph in terms of rank2019-05-29Paper
Modulo 5-orientations and degree sequences2019-05-03Paper
Vertex-connectivity and $Q$-index of graphs with fixed girth2019-04-09Paper
Pancyclicity of 4-connected \(\{K_{1,3},Z_8\}\)-free graphs2019-03-21Paper
https://portal.mardi4nfdi.de/entity/Q31193352019-03-11Paper
Constructing graphs which are permanental cospectral and adjacency cospectral2019-01-11Paper
Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs2018-11-29Paper
Packing spanning trees in highly essentially connected graphs2018-11-13Paper
Supereulerian bipartite digraphs2018-10-31Paper
3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs2018-09-25Paper
https://portal.mardi4nfdi.de/entity/Q46832862018-09-20Paper
Modulo orientations with bounded independence number2018-09-06Paper
A note on eigenvalues and Hamiltoinan properties of $k$-connected graphs2018-09-04Paper
Spanning tree packing, edge-connectivity and eigenvalues of graphs with given girth2018-08-18Paper
Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees2018-08-16Paper
https://portal.mardi4nfdi.de/entity/Q45681522018-06-15Paper
The connectivity of generalized graph products2018-05-25Paper
Upper bounds of \(r\)-hued colorings of planar graphs2018-05-24Paper
List \(r\)-hued chromatic number of graphs with bounded maximum average degrees2018-04-05Paper
Degree sum and Hamiltonian-connected line graphs2018-04-05Paper
Connectivity keeping stars or double-stars in 2-connected graphs2018-02-23Paper
\(r\)-hued coloring of sparse graphs2018-02-22Paper
Locally dense supereulerian digraphs2018-02-22Paper
Mod $(2p+1)$-Orientation on Bipartite Graphs and Complementary Graphs2018-01-12Paper
A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs2017-12-20Paper
Characterizations of \(k\)-cutwidth critical trees2017-10-17Paper
Supereulerian width of dense graphs2017-09-18Paper
Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees2017-08-31Paper
The index problem of group connectivity2017-07-25Paper
A note on edge degree and spanning trail containing given edges2017-06-22Paper
The (signless) Laplacian spectral radii ofc-cyclic graphs withnvertices, girthgandkpendant vertices2017-04-25Paper
Panconnected index of graphs2017-02-27Paper
Onk-Maximal Strength Digraphs2017-02-01Paper
Characterization of Digraphic Sequences with Strongly Connected Realizations2017-02-01Paper
Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs2016-11-25Paper
https://portal.mardi4nfdi.de/entity/Q28232022016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q28225962016-09-30Paper
Algorithms for the partial inverse matroid problem in which weights can only be increased2016-09-15Paper
Fractional spanning tree packing, forest covering and eigenvalues2016-09-12Paper
https://portal.mardi4nfdi.de/entity/Q29921882016-08-10Paper
Algorithm for constraint partial inverse matroid problem with weight increase forbidden2016-07-05Paper
On the lower bound of \(k\)-maximal digraphs2016-06-16Paper
Extendability of contractible configurations for nowhere-zero flows and modulo orientations2016-06-09Paper
Ore-type degree condition of supereulerian digraphs2016-05-18Paper
Dicycle cover of Hamiltonian oriented graphs2016-04-26Paper
Supereulerian Digraphs with Large Arc-Strong Connectivity2016-04-15Paper
Element deletion changes in dynamic coloring of graphs2016-04-07Paper
Hamiltonian-connected graphs with large neighborhoods and degrees2016-04-05Paper
Supereulerian digraphs with given local structures2016-03-01Paper
Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs2016-02-12Paper
Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs2016-02-01Paper
On Perfect Matching Coverings and Even Subgraph Coverings2016-02-01Paper
Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs2016-01-21Paper
Graphs with a 3-cycle-2-cover2015-12-17Paper
On dense strongly \(\mathbb{Z}_{2 s + 1}\)-connected graphs2015-12-08Paper
On \(r\)-hued coloring of planar graphs with girth at least 62015-12-07Paper
Interval minors of complete multipartite graphs2015-08-05Paper
On the Equitable Vertex Arboricity of Graphs2015-05-30Paper
On the regular k-independence number of graphs2015-05-19Paper
Two operations on a graph preserving the (non)existence of 2-factors in its line graph2015-05-06Paper
On Mod $(2s+1)$-Orientations of Graphs2015-04-17Paper
Characterizations of strength extremal graphs2015-01-20Paper
Per-spectral characterizations of some edge-deleted subgraphs of a complete graph2015-01-14Paper
https://portal.mardi4nfdi.de/entity/Q29367232015-01-06Paper
Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs2014-12-29Paper
Augmenting and preserving partition connectivity of a hypergraph2014-12-22Paper
Characterizations of minimal graphs with equal edge connectivity and spanning tree packing number2014-10-20Paper
Collapsible graphs and Hamiltonicity of line graphs2014-09-19Paper
On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs2014-08-22Paper
Realizing degree sequences as \(Z_3\)-connected graphs2014-08-21Paper
Note on edge-disjoint spanning trees and eigenvalues2014-07-22Paper
Supereulerian digraphs2014-06-25Paper
On the existence of super edge-connected graphs with prescribed degrees2014-05-06Paper
https://portal.mardi4nfdi.de/entity/Q54123552014-04-25Paper
Edge-disjoint spanning trees and eigenvalues2014-04-02Paper
Spanning 3-connected index of graphs2014-02-25Paper
On spanning disjoint paths in line graphs2014-02-14Paper
Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs2014-01-20Paper
On \(r\)-hued coloring of \(K_4\)-minor free graphs2014-01-16Paper
On extremal \(k\)-supereulerian graphs2013-12-03Paper
Ons-Hamiltonian Line Graphs2013-11-15Paper
https://portal.mardi4nfdi.de/entity/Q28466472013-09-09Paper
On group choosability of total graphs2013-06-26Paper
https://portal.mardi4nfdi.de/entity/Q49248882013-06-10Paper
\(\mod(2p+1)\)-orientations in line graphs2013-04-04Paper
Characterization of minimally \((2,l)\)-connected graphs2013-04-04Paper
Non-separating subgraphs2013-03-01Paper
Note on the spectral characterization of some cubic graphs with maximum number of triangles2013-01-16Paper
The connectivity and diameter of second order circuit graphs of matroids2012-12-27Paper
Group colorability of multigraphs2012-11-22Paper
Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid2012-10-19Paper
Hamiltonicity of 3-connected line graphs2012-10-17Paper
Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees2012-09-18Paper
Spanning cycles in regular matroids without small cocircuits2012-09-12Paper
Collapsible graphs and Hamiltonian connectedness of line graphs2012-08-14Paper
A dual version of the brooks group coloring theorem2012-08-10Paper
On 3-connected Hamiltonian line graphs2012-06-18Paper
Group connectivity of complementary graphs2012-06-13Paper
Degree condition and \(Z_3\)-connectivity2012-05-30Paper
On dynamic coloring for planar graphs and graphs of higher genus2012-05-30Paper
Spanning subgraph with Eulerian components2012-03-16Paper
https://portal.mardi4nfdi.de/entity/Q31150522012-02-20Paper
On 3-edge-connected supereulerian graphs2012-01-24Paper
\(Z_3\)-connectivity of 4-edge-connected 2-triangular graphs2012-01-11Paper
Supereulerian graphs and matchings2011-12-28Paper
Degree sequences and graphs with disjoint spanning trees2011-10-27Paper
https://portal.mardi4nfdi.de/entity/Q30945372011-10-25Paper
Group connectivity in line graphs2011-10-21Paper
Obstructions to a binary matroid being graphic2011-08-09Paper
EVERY N2-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z3-CONNECTED2011-08-02Paper
https://portal.mardi4nfdi.de/entity/Q30135192011-07-18Paper
https://portal.mardi4nfdi.de/entity/Q30117922011-06-29Paper
https://portal.mardi4nfdi.de/entity/Q30097442011-06-24Paper
Group connectivity and group colorings of graphs --- a survey2011-04-06Paper
Supereulerian graphs in the graph family \(C_{2}(6,k)\)2011-03-10Paper
https://portal.mardi4nfdi.de/entity/Q30703202011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q30703492011-02-02Paper
Balanced and 1-balanced graph constructions2010-11-25Paper
Every 3‐connected claw‐free Z 8 ‐free graph is Hamiltonian2010-11-10Paper
Degree sum condition for \(Z_{3}\)-connectivity in graphs2010-10-28Paper
On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)2010-10-11Paper
https://portal.mardi4nfdi.de/entity/Q35767222010-07-30Paper
The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index2010-07-07Paper
On (s,t)-supereulerian graphs in locally highly connected graphs2010-04-27Paper
Degree conditions for group connectivity2010-04-27Paper
Hamilton-connected indices of graphs2009-12-15Paper
The supereulerian graphs in the graph family \(C(l,k)\)2009-12-09Paper
Generalized honeycomb torus is Hamiltonian2009-08-27Paper
Multi-gbase index of primitive anti-symmetric sign pattern matrices2009-08-12Paper
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs2009-07-14Paper
Hamiltonian connectedness in 3-connected line graphs2009-06-30Paper
On group connectivity of graphs2009-05-08Paper
Random walks for selected Boolean implication and equivalence problems2009-04-27Paper
https://portal.mardi4nfdi.de/entity/Q36205252009-04-14Paper
Edge-connectivity and edge-disjoint spanning trees2009-04-09Paper
Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected2009-03-04Paper
Transforming a graph into a 1-balanced graph2009-03-04Paper
On mod \((2p+1)\)-orientations of graphs2009-03-04Paper
Degree sequence and supereulerian graphs2009-01-28Paper
Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected2009-01-27Paper
Nowhere-zero 3-flows in triangularly connected graphs2008-12-08Paper
Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions2008-12-05Paper
Hamiltonian-connected graphs2008-09-11Paper
On \(s\)-Hamiltonian-connected line graphs2008-09-04Paper
The \(s\)-Hamiltonian index2008-09-04Paper
Hamiltonian connected hourglass free line graphs2008-05-13Paper
New sufficient condition for Hamiltonian graphs2007-12-06Paper
Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors2007-11-30Paper
An inequality for the group chromatic number of a graph2007-11-30Paper
On circular flows of graphs2007-11-12Paper
An \(s\)-Hamiltonian line graph problem2007-09-10Paper
https://portal.mardi4nfdi.de/entity/Q35961362007-08-29Paper
https://portal.mardi4nfdi.de/entity/Q52956202007-07-30Paper
Quadrangularly connected claw-free graphs2007-03-15Paper
Collapsible biclaw-free graphs2006-09-14Paper
Conditional colorings of graphs2006-09-14Paper
Hamiltonicity in 3-connected claw-free graphs2006-07-12Paper
Every 3-connected, essentially 11-connected line graph is Hamiltonian2006-07-12Paper
On group chromatic number of graphs2006-06-16Paper
Group chromatic number of planar graphs of girth at least 42006-06-06Paper
Group connectivity of graphs with diameter at most 22006-04-06Paper
https://portal.mardi4nfdi.de/entity/Q54660882005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q54635802005-08-04Paper
Nowhere zero 4‐flow in regular matroids2005-08-01Paper
https://portal.mardi4nfdi.de/entity/Q54615022005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q27159952005-07-20Paper
Spanning trails connecting given edges2005-05-12Paper
HamiltonianN2-locally connected claw-free graphs2005-04-21Paper
Eulerian subgraphs and Hamilton-connected line graphs2005-02-23Paper
Global asymptotic stability in a rational recursive sequence2005-01-17Paper
On the maximal connected component of hypercube with faulty vertices2004-12-29Paper
Minimally (k, k)‐edge‐connected graphs2003-10-29Paper
Small cycle cover of 2-connected cubic graphs2003-08-19Paper
Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs2003-05-11Paper
Nowhere‐zero 3‐flows in locally connected graphs2003-04-03Paper
Cycle cover ratio of regular matroids2003-03-18Paper
Line graphs and forbidden induced subgraphs2002-12-10Paper
https://portal.mardi4nfdi.de/entity/Q45441032002-08-11Paper
Hamilton weights and Petersen minors2002-07-11Paper
Group chromatic number of graphs without \(K_5\)-minors2002-05-14Paper
Nowhere zero flows in line graphs2002-04-08Paper
https://portal.mardi4nfdi.de/entity/Q27326352002-01-27Paper
https://portal.mardi4nfdi.de/entity/Q27610032001-12-17Paper
Graph family operations2001-10-03Paper
Paul Catlin 1948-19952001-09-12Paper
Group connectivity of 3-edge-connected chordal graphs2001-08-16Paper
https://portal.mardi4nfdi.de/entity/Q48746062001-07-30Paper
https://portal.mardi4nfdi.de/entity/Q27159612001-05-30Paper
Eulerian subgraphs containing given edges2001-04-24Paper
https://portal.mardi4nfdi.de/entity/Q44891702001-01-14Paper
https://portal.mardi4nfdi.de/entity/Q45175382000-11-22Paper
https://portal.mardi4nfdi.de/entity/Q49432802000-08-28Paper
https://portal.mardi4nfdi.de/entity/Q42645631999-09-22Paper
Extending a partial nowhere-zero 4-flow1999-09-10Paper
https://portal.mardi4nfdi.de/entity/Q42438061999-09-10Paper
https://portal.mardi4nfdi.de/entity/Q43876971998-10-01Paper
https://portal.mardi4nfdi.de/entity/Q43906741998-06-14Paper
Eulerian subgraphs containing given vertices and hamiltonian line graphs1998-01-26Paper
A property on edge-disjoint spanning trees1997-04-21Paper
Graphs without spanning closed trails1997-04-07Paper
https://portal.mardi4nfdi.de/entity/Q52845741997-02-23Paper
https://portal.mardi4nfdi.de/entity/Q52845691997-01-22Paper
Every matroid is a submatroid of a uniformly dense matroid1997-01-13Paper
https://portal.mardi4nfdi.de/entity/Q48651201996-08-20Paper
Supereulerian graphs and the Petersen graph1996-06-18Paper
https://portal.mardi4nfdi.de/entity/Q48710321996-05-21Paper
https://portal.mardi4nfdi.de/entity/Q48738031996-04-21Paper
https://portal.mardi4nfdi.de/entity/Q48622401996-04-08Paper
Strength and fractional arboricity of complementary graphs1996-02-12Paper
Supereulerian graphs and excluded induced minors1996-02-01Paper
Large survivable nets and the generalized prisms1995-11-27Paper
https://portal.mardi4nfdi.de/entity/Q43262021995-09-12Paper
Vertex arboricity and maximum degree1995-07-24Paper
The size of graphs without nowhere‐zero 4‐flows1995-05-14Paper
Every 4-connected line graph of a planar graph is Hamiltonian1994-12-11Paper
https://portal.mardi4nfdi.de/entity/Q43045761994-10-13Paper
https://portal.mardi4nfdi.de/entity/Q42881851994-08-28Paper
Small circuit double covers of cubic multigraphs1994-06-06Paper
Edge‐maximal (k, i)‐graphs1994-05-05Paper
https://portal.mardi4nfdi.de/entity/Q31398581994-04-25Paper
Collapsible graphs and matchings1993-12-10Paper
Supereulerian complementary graphs1993-08-17Paper
https://portal.mardi4nfdi.de/entity/Q40330121993-05-18Paper
Duality in graph families1993-05-16Paper
Nowhere-zero 3-flows of highly connected graphs1993-05-16Paper
Fractional arboricity, strength, and principal partitions in graphs and matroids1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40285331993-03-28Paper
Graph whose edges are in small cycles1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39870391992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39912691992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39832591992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39813701992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39746931992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47111551992-06-25Paper
The size of strength‐maximal graphs1992-06-25Paper
Reduced graphs of diameter two1990-01-01Paper
Unique graph homomorphisms onto odd cycles. II1989-01-01Paper
On the Hamiltonian index1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37623361987-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Hong-Jian Lai