Research Problem Websites	B. Mohar’s Website D. West’s Website
Open Problems	Problems in Eulerian Subgraphs Problems in Group Connectivity and Group Colorings

Matrices in Combinatorics and Graph Theory (with Bolian Liu)	Kluwer Academic Publishers, Vol. 3 of Network Theory and Applications, (2000), (ISBN: 0-7923-6469-4)	Purchase Information
Matroid Theory (in Chinese) Errata of this boook	Chinese Higher Education Press, (2002), (ISBN: 7-04-010563-2)	Purchase Information

Research Interests And Recent Publications
Recent Publications:
Nowherezero 3-flow in triangularly connected graphs	J. Combinatorial Theory, Ser. B. 98 (2008) 1325-1336.
Degree Sequence and Supereulerian Graphs,	Discrete Math., 308 (2008) 6626-6631.
A lower bound of the l-edge-connectivity and optimal graphs	J. Combinatorial Mathematics and Combinatorial Computing, 66 (2008) 79-95.
Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected	Discrete Math., 308 (2008) 5312-5316.
On s-hamiltonian-connected line graphs	Discrete Math., 308 (2008) 4293-4297
Hamiltonian connected hourglass free line graphs	Discrete Math., 308 (2008) 2634-2636.
Hamiltonian connected graphs	Computers and Mathematics with Applications, 55 (2008) 2707-2714.
Group connectivity of certain graphs	Ars Combinatoria, 89 (2008) 141-158.
New Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs	Ars.Combinatoria 88 (2008), 217-227
On group connectivity of graphs	Graphs and Combinatorics, 24 (2008) 1-9
Spanning cycles in regular matroids without $M^*(K_5)$ minors	European J. Combin. 29 (2008), no. 1, 298--310
An s-hamltonian line graph problem	Graphs and Combinatorics, 23 (2007), no. 3, 241--248
Mod $(2p+1)$-orientations and $K_{1, 2p+1}$-decompositions	SIAM J. of Discrete Math., 21 (2007) 844-850.
An inequality for the group chromatic number of a graph	Discrete Math., 307 (2007) 3076-3080.
Note on circular flows of graphs	Combinatorica, 27 (2007) 245-246.
Some problems related to hamiltonian line graphs	AMS/IP Studies in Advanced Mathematics, 39 (2007), 149-159.
Quadrangularly connected claw-free graphs	Discrete Math. 307 (2007) 1205-1211.
New sufficient condition for hamiltonian graphs	Applied Math Letters, 20 (2007), no. 1, 116-122.
Collapsible biclaw-free graphs Errata	Discrete Math, 306 (2006) 2115-2117. Discrete Math, 307 (2007) 1217.
Spanning Eulerian Subgraphs in claw-free graphs	J. of Combinatorial Math. And Combinatorial Computing, 59 (2006), 165--171. 05C45
Conditional Colorings of Graphs	Discrete Mathematics, 306 (2006) 1997-2004.
Every 3-connected, essentially 11-connected line graph is hamiltonian	J. Combinatorial Theory, Ser. B, 96 (2006) 571-576.
Hamiltonicity in 3-connected Claw-Free Graphs	J. Combinatorial Theory, Ser. B, 96 (2006) 493-504.
Group connectivity of graphs with diameter at most 2	Europ. J. Combinatorics, 27 (2006), 436-443.
Group chromatic number of planar graphs of girth at least 4	J. Graph Theory, 52 (2006) 51-72.
Group chromatic number of graphs	Graphs and Combinatorics, 21 (2005) 469-474.
Spanning trails connecting given edges	Graphs and Combinatorics, 21 (2005), no. 1, 77--88. 05C40
Nowhere zero 4-flow in regular matroids	J. Graph Theory, 49 (2005) 196-204.
Supereulerian planar graphs	Ars Combinatoria, 75 (2005), 313-331.
Hamiltonian N_2-locally Connected Claw-Free Graphs	J. Graph Theory 48 (2005), no. 2, 142--146.
Eulerian subgraphs and hamiltonian connected line graphs	Discrete Applied Math 145 (2005) 422-428.
Recently Accepted Publications
Obtaining a uniformly dense graph from a non-uniformly dense graph	Discrete Applied. Math
Hamiltonian connectedness in 3-connected line graphs	Discrete Applied. Math
Edge-connectivity and edge-disjoint spanning trees	Discrete Math
Hamilton-Connected Indices of Graphs	Discrete Math,
The Supereulerian Graphs in the Graph Family $C(l,k)$,	Discrete Math
The $s$-Hamiltonian Index	Discrete Math,
Every line graph of a 4-edge-connected graph is ${\bf Z}_3$-connected	European J. Combinatorics
Reinforcing the number of disjoint spanning trees	Ars Combinatoria
Spanning eulerian subgraphs in $N^2$-locally connected claw-free graphs	Ars Combinatoria
Regular matroids without disjoint circuits	Ars Combinatoria
On mod $(2p+1)$-orientations of graphs	J. Combinatorial Theory, Ser. B
Current Research
Cycles and Eulerian Subgraphs
Every 3-connected claw-free $Z_8$-free graph is hamiltonian	The Chvatal-Erdos condition for supereulerian graphs and the hamiltonian index
Flows and Cycle  Covers, Graph Coloring and its Generalizations
Degree Conditions for Group Connectivity
Uniformly Dense Graphs
Applications of Mathematics
Energy Management System with Automatic Reconfigurationfor Electric Shipboard Power Systems	Proceedings, Reconfiguration and Survivability Symposium 2005, Atlantic Beach, FL. Feb 16-18, 2005.
Distributed Control Agents Approach to Energy Management In Electric Shipboard Power Systems	IEEE PES General Meeting, June 18-22, 2006, Montral, Canada (panel paper)
Distributed Approaches for Determinations of Reconfiguration Algorithm Termination	Proceedings of the Electric Ship Technologies Symposium (ESTS) 2007, Arlington, VA, May 21-23, 2007
Age distribution and risk factors for the onset of severe disability among community-dwelling older adults with functional limitations,	The Journal of Applied Gerontology, 26 (2007) 258-273.
Health Behavior and Transition of Physical Disability Among Community Dwelling Older Edults	Research on Aging, 30 (2008) 572-591
Presentations	Math Dept Publications 2006 2007
Publication List of Hong-Jian Lai

2