Hong-Jian Lai
According to our database1,
Hong-Jian Lai
authored at least 194 papers
between 1988 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
On csauthors.net:
Bibliography
2019
Pancyclicity of 4-Connected { K1, 3, Z8} -Free Graphs.
Graphs and Combinatorics, 2019
Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs.
Discrete Mathematics, 2019
Spectral results on Hamiltonian problem.
Discrete Mathematics, 2019
On r-hued colorings of graphs without short induced paths.
Discrete Mathematics, 2019
Packing spanning trees in highly essentially connected graphs.
Discrete Mathematics, 2019
Modulo 5-orientations and degree sequences.
Discrete Applied Mathematics, 2019
Collapsible subgraphs of a 4-edge-connected graph.
Discrete Applied Mathematics, 2019
Spectral analogues of Erdős' theorem on Hamilton-connected graphs.
Applied Mathematics and Computation, 2019
Vertex-connectivity and eigenvalues of graphs with fixed girth.
Applied Mathematics and Computation, 2019
2018
An O(log2(N)) Algorithm for Reliability Evaluation of h-Extra Edge-Connectivity of Folded Hypercubes.
IEEE Trans. Reliability, 2018
Mod (2p+1)-Orientation on Bipartite Graphs and Complementary Graphs.
SIAM J. Discrete Math., 2018
Supereulerian bipartite digraphs.
Journal of Graph Theory, 2018
Nowhere-zero 3-flow and -connectedness in graphs with four edge-disjoint spanning trees.
Journal of Graph Theory, 2018
The connectivity of generalized graph products.
Inf. Process. Lett., 2018
Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral.
Graphs and Combinatorics, 2018
Connectivity keeping stars or double-stars in 2-connected graphs.
Discrete Mathematics, 2018
List r-hued chromatic number of graphs with bounded maximum average degrees.
Discrete Mathematics, 2018
Degree sum and hamiltonian-connected line graphs.
Discrete Mathematics, 2018
A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs.
Discrete Mathematics, 2018
Upper bounds of r-hued colorings of planar graphs.
Discrete Applied Mathematics, 2018
Modulo orientations with bounded independence number.
Discrete Applied Mathematics, 2018
r-hued coloring of sparse graphs.
Discrete Applied Mathematics, 2018
Locally dense supereulerian digraphs.
Discrete Applied Mathematics, 2018
Strongly Spanning Trailable Graphs with Short Longest Paths.
Ars Comb., 2018
Linear list r-hued colorings of graphs with bounded maximum subgraph average degrees.
Ars Comb., 2018
On the permanental sum of graphs.
Applied Mathematics and Computation, 2018
2017
Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees.
SIAM J. Discrete Math., 2017
Characterization of Digraphic Sequences with Strongly Connected Realizations.
Journal of Graph Theory, 2017
On k-Maximal Strength Digraphs.
Journal of Graph Theory, 2017
Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs.
J. Comb. Theory, Ser. B, 2017
Characterizations of k-cutwidth critical trees.
J. Comb. Optim., 2017
Supereulerian width of dense graphs.
Discrete Mathematics, 2017
Panconnected index of graphs.
Discrete Mathematics, 2017
Spanning trails with variations of Chvátal-Erdős conditions.
Discrete Mathematics, 2017
3-dynamic coloring and list 3-dynamic coloring of K1, 3-free graphs.
Discrete Applied Mathematics, 2017
2016
Algorithm for constraint partial inverse matroid problem with weight increase forbidden.
Theor. Comput. Sci., 2016
On Perfect Matching Coverings and Even Subgraph Coverings.
Journal of Graph Theory, 2016
Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs.
Journal of Graph Theory, 2016
Supereulerian Digraphs with Large Arc-Strong Connectivity.
Journal of Graph Theory, 2016
Algorithms for the partial inverse matroid problem in which weights can only be increased.
J. Global Optimization, 2016
Supereulerian digraphs with given local structures.
Inf. Process. Lett., 2016
Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations.
Graphs and Combinatorics, 2016
On dense strongly Z2s-1-connected graphs.
Discrete Mathematics, 2016
Element deletion changes in dynamic coloring of graphs.
Discrete Mathematics, 2016
On the lower bound of k-maximal digraphs.
Discrete Mathematics, 2016
Ore-type degree condition of supereulerian digraphs.
Discrete Mathematics, 2016
On r-hued coloring of planar graphs with girth at least 6.
Discrete Applied Mathematics, 2016
Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs.
Discrete Applied Mathematics, 2016
Supereulerian graphs with width s and s-collapsible graphs.
Discrete Applied Mathematics, 2016
Fractional spanning tree packing, forest covering and eigenvalues.
Discrete Applied Mathematics, 2016
2015
Graphs with a 3-Cycle-2-Cover.
Graphs and Combinatorics, 2015
Degree sequence realizations with given packing and covering of spanning trees.
Discrete Applied Mathematics, 2015
K-5-factor in a Graph.
Ars Comb., 2015
2014
On Mod (2s+1)-Orientations of Graphs.
SIAM J. Discrete Math., 2014
Spanning 3-connected index of graphs.
J. Comb. Optim., 2014
Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs.
Int. J. Comput. Math., 2014
Collapsible Graphs and Hamiltonicity of Line Graphs.
Graphs and Combinatorics, 2014
Characterizations of Strength Extremal Graphs.
Graphs and Combinatorics, 2014
Realizing degree sequences as Z3-connected graphs.
Discrete Mathematics, 2014
On the existence of super edge-connected graphs with prescribed degrees.
Discrete Mathematics, 2014
On r-hued coloring of K4-minor free graphs.
Discrete Mathematics, 2014
Supereulerian digraphs.
Discrete Mathematics, 2014
Spanning trails in essentially 4-edge-connected graphs.
Discrete Applied Mathematics, 2014
On strongly Z2s-1-connected graphs.
Discrete Applied Mathematics, 2014
Bounds of eigenvalues of a nontrivial bipartite graph.
Ars Comb., 2014
2013
Analytical Solution of Steady-State Equations for Chemical Reaction Networks with Bilinear Rate Laws.
IEEE/ACM Trans. Comput. Biology Bioinform., 2013
On s-Hamiltonian Line Graphs.
Journal of Graph Theory, 2013
On Spanning Disjoint Paths in Line Graphs.
Graphs and Combinatorics, 2013
Hamilton cycles in 3-connected claw-free and net-free graphs.
Discrete Mathematics, 2013
Group colorability of multigraphs.
Discrete Mathematics, 2013
Non-separating subgraphs.
Discrete Mathematics, 2013
Realizing degree sequences with k-edge-connected uniform hypergraphs.
Discrete Mathematics, 2013
2012
Group connectivity of complementary graphs.
Journal of Graph Theory, 2012
The Connectivity and Diameter of Second Order Circuit Graphs of Matroids.
Graphs and Combinatorics, 2012
Spanning cycles in regular matroids without small cocircuits.
Eur. J. Comb., 2012
Z3-connectivity of 4-edge-connected 2-triangular graphs.
Eur. J. Comb., 2012
Spanning subgraph with Eulerian components.
Discrete Mathematics, 2012
Degree condition and Z3-connectivity.
Discrete Mathematics, 2012
A dual version of the Brooks group coloring theorem.
Discrete Mathematics, 2012
On 3-connected hamiltonian line graphs.
Discrete Mathematics, 2012
Collapsible graphs and Hamiltonian connectedness of line graphs.
Discrete Applied Mathematics, 2012
Characterization of removable elements with respect to having k disjoint bases in a matroid.
Discrete Applied Mathematics, 2012
On dynamic coloring for planar graphs and graphs of higher genus.
Discrete Applied Mathematics, 2012
Hamiltonian graphs involving neighborhood conditions.
Ars Comb., 2012
Spanning Eulerian Subgraphs in Generalized Prisms.
Ars Comb., 2012
Hamiltonicity of 3-connected line graphs.
Appl. Math. Lett., 2012
Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees.
Appl. Math. Lett., 2012
2011
Mod (2p+1)-orientations in line graphs.
Inf. Process. Lett., 2011
Characterization of minimally (2, l)-connected graphs.
Inf. Process. Lett., 2011
On 3-Edge-Connected Supereulerian Graphs.
Graphs and Combinatorics, 2011
Obstructions to a binary matroid being graphic.
Eur. J. Comb., 2011
Every N2-Locally Connected claw-Free Graph with Minimum Degree at Least 7 is Z3-Connected.
Discrete Math., Alg. and Appl., 2011
Group connectivity in line graphs.
Discrete Mathematics, 2011
Degree sequences and graphs with disjoint spanning trees.
Discrete Applied Mathematics, 2011
Supereulerian graphs in the graph family C2(6, k).
Discrete Applied Mathematics, 2011
Supereulerian graphs and matchings.
Appl. Math. Lett., 2011
2010
Every 3-connected claw-free Z8-free graph is Hamiltonian.
Journal of Graph Theory, 2010
Degree sum condition for Z3-connectivity in graphs.
Discrete Mathematics, 2010
Degree conditions for group connectivity.
Discrete Mathematics, 2010
On 3-edge-connected supereulerian graphs in graph family C(l, k).
Discrete Mathematics, 2010
On (s, t)-supereulerian graphs in locally highly connected graphs.
Discrete Mathematics, 2010
The Chvátal-Erdös condition for supereulerian graphs and the Hamiltonian index.
Discrete Mathematics, 2010
Balanced and 1-balanced graph constructions.
Discrete Applied Mathematics, 2010
Spanning eulerian subgraphs in N2-locally connected claw-free graphs.
Ars Comb., 2010
Emergence of Specialization in a Swarm of Robots.
Proceedings of the Distributed Autonomous Robotic Systems, 2010
2009
On mod (2p+1)-orientations of graphs.
J. Comb. Theory, Ser. B, 2009
Every line graph of a 4-edge-connected graph is I-connected.
Eur. J. Comb., 2009
The supereulerian graphs in the graph family C(l, k).
Discrete Mathematics, 2009
Hamilton-connected indices of graphs.
Discrete Mathematics, 2009
Edge-connectivity and edge-disjoint spanning trees.
Discrete Mathematics, 2009
Hamiltonian connectedness in 3-connected line graphs.
Discrete Applied Mathematics, 2009
Transforming a graph into a 1-balanced graph.
Discrete Applied Mathematics, 2009
Reinforcing the number of disjoint spanning trees.
Ars Comb., 2009
Random walks for selected boolean implication and equivalence problems.
Acta Inf., 2009
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009
2008
Nowhere-zero 3-flows in triangularly connected graphs.
J. Comb. Theory, Ser. B, 2008
On Group Connectivity of Graphs.
Graphs and Combinatorics, 2008
Spanning cycles in regular matroids without M*(K5) minors.
Eur. J. Comb., 2008
The s-Hamiltonian index.
Discrete Mathematics, 2008
Hamiltonian connected hourglass free line graphs.
Discrete Mathematics, 2008
Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected.
Discrete Mathematics, 2008
On s-hamiltonian-connected line graphs.
Discrete Mathematics, 2008
Degree sequence and supereulerian graphs.
Discrete Mathematics, 2008
Hamiltonian-connected graphs.
Computers & Mathematics with Applications, 2008
New Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs.
Ars Comb., 2008
Group connectivity of certain graphs.
Ars Comb., 2008
2007
Mod (2p + 1)-Orientations and $K1,2p+1-Decompositions.
SIAM J. Discrete Math., 2007
An s -Hamiltonian Line Graph Problem.
Graphs and Combinatorics, 2007
Quadrangularly connected claw-free graphs.
Discrete Mathematics, 2007
Erratum to "Collapsible biclaw-free graphs": [Discrete Math 306 (2006) 2115-2117].
Discrete Mathematics, 2007
An inequality for the group chromatic number of a graph.
Discrete Mathematics, 2007
On Circular Flows Of Graphs.
Combinatorica, 2007
New sufficient condition for Hamiltonian graphs.
Appl. Math. Lett., 2007
Hamiltonian Connected Line Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007
2006
Group chromatic number of planar graphs of girth at least 4.
Journal of Graph Theory, 2006
Hamiltonicity in 3-connected claw-free graphs.
J. Comb. Theory, Ser. B, 2006
Every 3-connected, essentially 11-connected line graph is Hamiltonian.
J. Comb. Theory, Ser. B, 2006
Group connectivity of graphs with diameter at most 2.
Eur. J. Comb., 2006
Collapsible biclaw-free graphs.
Discrete Mathematics, 2006
Conditional colorings of graphs.
Discrete Mathematics, 2006
2005
Hamiltonian N2-locally connected claw-free graphs.
Journal of Graph Theory, 2005
Nowhere zero 4-flow in regular matroids.
Journal of Graph Theory, 2005
Spanning Trails Connecting Given Edges.
Graphs and Combinatorics, 2005
On Group Chromatic Number of Graphs.
Graphs and Combinatorics, 2005
Eulerian subgraphs and Hamilton-connected line graphs.
Discrete Applied Mathematics, 2005
Supereulerian planar graphs.
Ars Comb., 2005
2004
Generalized honeycomb torus is Hamiltonian.
Inf. Process. Lett., 2004
On the maximal connected component of hypercube with faulty vertices.
Int. J. Comput. Math., 2004
Global asymptotic stability in a rational recursive sequence.
Applied Mathematics and Computation, 2004
2003
Nowhere-zero 3-flows in locally connected graphs.
Journal of Graph Theory, 2003
Minimally (k, k)-edge-connected graphs.
Journal of Graph Theory, 2003
Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs.
Journal of Graph Theory, 2003
Small cycle cover of 2-connected cubic graphs.
Discrete Mathematics, 2003
Upper Bounds of Dynamic Chromatic Number.
Ars Comb., 2003
2002
Group Chromatic Number of Graphs without K5-Minors.
Graphs and Combinatorics, 2002
Cycle Cover Ratio of Regular Matroids.
Eur. J. Comb., 2002
Group Colorability of Graphs.
Ars Comb., 2002
2001
Hamilton weights and Petersen minors.
Journal of Graph Theory, 2001
Line Graphs and Forbidden Induced Subgraphs.
J. Comb. Theory, Ser. B, 2001
Eulerian subgraphs containing given edges.
Discrete Mathematics, 2001
Paul Catlin 1948-1995.
Discrete Mathematics, 2001
Dedication.
Discrete Mathematics, 2001
Nowhere zero flows in line graphs.
Discrete Mathematics, 2001
Graph family operations.
Discrete Mathematics, 2001
2000
Group Connectivity of 3-Edge-Connected Chordal Graphs.
Graphs and Combinatorics, 2000
Spanning trails that join given edges in 3-edge-connected graphs.
Ars Comb., 2000
1999
Extending a partial nowhere-zero 4-flow.
Journal of Graph Theory, 1999
Connectivity of cycle matroids and bicircular matroids.
Ars Comb., 1999
1998
Eulerian subgraphs containing given vertices and hamiltonian line graphs.
Discrete Mathematics, 1998
Supereulerian graphs and the Petersen Graph, II.
Ars Comb., 1998
1996
Supereulerian Graphs and the Petersen Graph.
J. Comb. Theory, Ser. B, 1996
A Property on Edge-disjoint Spanning Trees.
Eur. J. Comb., 1996
Graphs without spanning closed trails.
Discrete Mathematics, 1996
1995
The size of graphs without nowhere-zero 4-flows.
Journal of Graph Theory, 1995
Strength and fractional arboricity of complementary graphs.
Discrete Mathematics, 1995
Supereulerian graphs and excluded induced minors.
Discrete Mathematics, 1995
Vertex arboricity and maximum degree.
Discrete Mathematics, 1995
Every Matroid Is a Submatroid of a Uniformly Dense Matroid.
Discrete Applied Mathematics, 1995
Large Survivable Nets and the Generalized Prisms.
Discrete Applied Mathematics, 1995
The size of graphs with given edge inclusive connectivity.
Ars Comb., 1995
1994
Edge-maximal (k, i)-graphs.
Journal of Graph Theory, 1994
Small Circuit Double Covers of Cubic Multigraphs.
J. Comb. Theory, Ser. B, 1994
Every 4-Connected Line Graph of a Planar Graph is Hamiltonian.
Graphs and Combinatorics, 1994
1993
Supereulerian complementary graphs.
Journal of Graph Theory, 1993
Collapsible graphs and matchings.
Journal of Graph Theory, 1993
1992
Nowhere-zero 3-flows of highly connected graphs.
Discrete Mathematics, 1992
Duality in graph families.
Discrete Mathematics, 1992
Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids.
Discrete Applied Mathematics, 1992
1991
Graph whose edges are in small cycles.
Discrete Mathematics, 1991
1990
The size of strength-maximal graphs.
Journal of Graph Theory, 1990
Reduced graphs of diameter two.
Journal of Graph Theory, 1990
1989
Unique graph homomorphisms onto odd cycles, II.
J. Comb. Theory, Ser. B, 1989
1988
Contractions and hamiltonian line graphs.
Journal of Graph Theory, 1988
On the Hamiltonian index.
Discrete Mathematics, 1988