- Journal of Combinatorial Theory, Series B 99 (2009) 399406 Contents lists available at ScienceDirect
- Journal of Combinatorial Theory, Series B 82, 38 55 (2001) Line Graphs and Forbidden Induced Subgraphs
- Discrete Mathematics 306 (2006) 19972004 www.elsevier.com/locate/disc
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Global asymptotic stability in a rational recursive sequence q
- Discrete Mathematics 308 (2008) 47794785 www.elsevier.com/locate/disc
- Open Problems in Eulerian Subgraphs Hong-Jian Lai
- Open Problems in Group Connectivity and Group Colorings Hong-Jian Lai
- Table of Contents 1 Matrices and Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
- Nowhere-zero 3-flows in triangularly connected graphs Genghua Fan1
- Group connectivity of certain graphs Jingjing Chen
- Spanning cycles in regular matroids without M (K5) minors
- An s-Hamiltonian Line Graph Problem Zhi-Hong Chen
- Mod (2p + 1)-orientations and K1,2p+1-decompositions Hong-Jian Lai
- An inequality for the group chromatic number of Hong-Jian Lai1
- Quadrangularly Connected Claw-free Graphs , Liming Xiong
- ARTICLE IN PRESS Applied Mathematics Letters ( )
- Collapsible biclaw-free graphs Hong-Jian Lai
- Spanning Eulerian Subgraphs in claw-free Zhi-Hong Chen
- Conditional Colorings of Graphs , Hong-Jian Lai
- Supereulerian planar graphs Hong-Jian Lai and Mingquan Zhan
- The s-Hamiltonian Index Elaine Eschen
- The automatic reconfiguration of electric shipboard power systems is an important step toward improved
- Mod (2p + 1)-orientation of Graphs Hong-Jian Lai
- Hamiltonian Line Graphs and Related Hong-Jian Lai
- Hamiltonian Line Graphs and Related Hong-Jian Lai
- Circular Flows of Graphs Hong-Jian Lai
- journal of combinatorial theory, Series B 66, 123 139 (1996) Supereulerian Graphs and the Petersen Graph
- Extending a Partial Nowhere-Zero 4-Flow
- Discrete Mathematics 230 (2001) 6369 www.elsevier.com/locate/disc
- Group Chromatic Number of Graphs without K5-Minors Hong-Jian Lai1
- doi:10.1006/eujc.2002.0606 Available online at http://www.idealibrary.com on
- Nowhere-Zero 3-Flows in Locally Connected Graphs
- Discrete Mathematics 269 (2003) 295302 www.elsevier.com/locate/disc
- Discrete Applied Mathematics 145 (2005) 422428 www.elsevier.com/locate/dam
- Hamiltonian N2-Locally Connected Claw-Free
- Digital Object Identifier (DOI) 10.1007/s00373-005-0625-0 Graphs and Combinatorics (2005) 21:469474
- European Journal of Combinatorics 27 (2006) 436443 www.elsevier.com/locate/ejc
- Group Chromatic Number of Planar Graphs of Girth
- Discrete Mathematics 306 (2006) 21152117 www.elsevier.com/locate/disc
- Applied Mathematics Letters 20 (2007) 116122 www.elsevier.com/locate/aml
- Digital Object Identifier (DOI) 10.1007/s00373-008-0780-1 Graphs and Combinatorics (2008) 24:19
- Discrete Mathematics 308 (2008) 26342636 www.elsevier.com/locate/disc
- Discrete Mathematics 308 (2008) 53125316 www.elsevier.com/locate/disc
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Acta Informatica (2009) 46:155168 DOI 10.1007/s00236-009-0089-4
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- PLEASE SCROLL DOWN FOR ARTICLE This article was downloaded by: [West Virginia University]
- INTERNATIONAL JOURNAL OF MATHEMATICAL COMBINATORICS
- Erratum: Collapsible Biclaw-free Graphs Hong-Jian Lai
- Discrete Mathematics 230 (2001) 7197 www.elsevier.com/locate/disc
- Eulerian Subgraphs in 3-Edge-Connected
- Hamilton Weights and Petersen Minors
- Group Connectivity of Graphs Hong-Jian Lai
- Discrete Mathematics 230 (2001) 133141 www.elsevier.com/locate/disc
- Graphs and Combinatorics (2000) 16 : 165176 Combinatorics
- COMBINATORICA Bolyai Society Springer-Verlag
- Group connectivity of graphs with diameter at most 2 Hong-Jian Lai
- European Journal of Combinatorics 29 (2008) 298310 www.elsevier.com/locate/ejc
- Discrete Applied Mathematics 157 (2009) 982990 www.elsevier.com/locate/dam
- Journal of Combinatorial Theory, Series B 96 (2006) 493504 www.elsevier.com/locate/jctb
- Group chromatic number of planar graphs of girth at least 4
- Discrete Mathematics 310 (2010) 929934 Contents lists available at ScienceDirect
- Information Processing Letters 92 (2004) 3137 www.elsevier.com/locate/ipl
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2007 Society for Industrial and Applied Mathematics
- Table of Contents Chapter 0 Notations and Prerequisites . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
- http://roa.sagepub.com Research on Aging
- European Journal of Combinatorics 30 (2009) 595601 Contents lists available at ScienceDirect
- Regular matroids without disjoint circuits , Hong-Jian Lai
- Spanning Trails Connecting Given Edges Hong-Jian Lai1
- Journal of Combinatorial Theory, Series B 98 (2008) 13251336 www.elsevier.com/locate/jctb
- Reinforcing the number of disjoint spanning trees Damin Liu, Beijing University of Chemical Technology, P. R. China
- Digital Object Identifier (DOI) 10.1007/s00373-007-0727-y Graphs and Combinatorics (2007) 23:241248
- Abstract-The distribution network reconfiguration is a process that consists of changing the status of the
- Discrete Mathematics 308 (2008) 42934297 www.elsevier.com/locate/disc
- UNCORRECTED DISC: 7336 + Model pp. 17 (col. fig: NIL)
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Discrete Mathematics 307 (2007) 1217 www.elsevier.com/locate/disc
- Discrete Mathematics 307 (2007) 12051211 www.elsevier.com/locate/disc
- Discrete Mathematics 310 (2010) 10501058 Contents lists available at ScienceDirect
- Nowhere Zero 4-Flow in Regular Matroids
- Hamiltonian N2-locally Connected Claw-Free Graphs Hong-Jian Lai, Yehong Shao and Mingquan Zhan
- Distributed Approaches for Determination of Reconfiguration Algorithm Termination
- Computers and Mathematics with Applications 55 (2008) 27072714 www.elsevier.com/locate/camwa
- Nowhere zero 4-flow in regular matroids Hong-Jian Lai, Xiangwen Li and Hoifung Poon
- On mod (2p + 1)-orientations of graphs Hong-Jian Lai
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- On circular flows of graphs Hong-Jian Lai1
- Spanning eulerian subgraphs in N2 -locally connected
- Some problems related to hamiltonian line graphs Hong-Jian Lai and Yehong Shao
- IEEE TRANSACTIONS ON ENERGY CONVERSION, 2006 1 Distributed Control Agents Approach to Energy
- Hamiltonicity in 3-connected Claw-Free Graphs Hong-Jian Lai, Yehong Shao and Mingquan Zhan
- Every 3-connected, essentially 11-connected line graph is hamiltonian
- Spanning Trails Connecting Given Edges Hong-Jian Lai1
- Abstract--The electric power system has become a very complicated network at present because of re-structuring and
- Journal of Combinatorial Theory, Series B 96 (2006) 571576 www.elsevier.com/locate/jctb
- Graphs (Matroids) with k -disjoint spanning
- Discrete Mathematics 307 (2007) 30763080 www.elsevier.com/locate/disc
- On group chromatic number of graphs Hong-Jian Lai1
- Every line graph of a 4-edge-connected graph is Z3-connected HongJian Lai
- http://jag.sagepub.com Gerontology
- Minimally (k, k )-Edge-Connected Graphs
- Acta Mathematica Sinica, English Series Mar., 2011, Vol. 27, No. 3, pp. 405434
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- (This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Discrete Applied Mathematics 159 (2011) 467477 Contents lists available at ScienceDirect
- Discrete Mathematics 310 (2010) 33903397 Contents lists available at ScienceDirect
- Applied Mathematics, 2010, 1, 244-249 doi:10.4236/am.2010.13030 Published Online September 2010 (http://www.SciRP.org/journal/am)
- Every 3-Connected Claw-Free Z8-Free Graph
- Information Processing Letters 111 (2011) 11241129 Contents lists available at SciVerse ScienceDirect
- Applied Mathematics, 2011, 2, 1263-1269 Published Online October 2011 (http://www.SciRP.org/journal/am)
- (This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached
- 1st Reading May 23, 2011 14:33 WSPC/S1793-8309 257-DMAA 00114
