Hong-Jian Lai

273 papers Misc 2Journal 270Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Diameter two orientability of mixed graphs.
Discret. Math.
Hengzhe Li, Zhiwei Ding, Jianbing Liu, Hong-Jian Lai
2026 J jnl
Exploring Hamilton-connectedness in {K1,3,Γ0,P18}-free graphs.
Discret. Appl. Math.
Yang Wu, Mingquan Zhan, Yehong Shao, Hong-Jian Lai
2026 J jnl
On the neighbor full sum distinguishing total coloring of graphs.
Discret. Appl. Math.
Fei Wen, Zhongzheng Yue, Zepeng Li, Hong-Jian Lai
2026 J jnl
Spanning connectivity in graphs and line graphs with Chvátal-Erdős conditions.
Discret. Appl. Math.
Wei Xiong, Fengxia Liu, Yang Wu, Mingquan Zhan, Hong-Jian Lai
2026 J jnl
The spanning 3-connectivity of circuit graphs of matroids.
Discret. Appl. Math.
Wen Li, Wei Xiong, Xiaoqian Wang, Hong-Jian Lai
2026 J jnl
Upper bound of the list r-hued chromatic number.
Discret. Appl. Math.
Li Liu, Fengxia Liu, Yun Li, Hong-Jian Lai, Hua Cai
2025 J jnl
Injective edge coloring of sparse graphs.
Discret. Math. Algorithms Appl.
Hong-Jian Lai, Austin Luo
2025 J jnl
Ramsey and Gallai-Ramsey numbers for comb and sun graphs.
Discret. Appl. Math.
Xiao Xu, Meiqin Wei, Hong-Jian Lai, Yaping Mao
2025 J jnl
Supereulerian Oriented Graphs With Large Arc-Strong Connectivity.
J. Graph Theory
Jia Wei, Hong-Jian Lai
2025 J jnl
Supereulerian of regular matroids with cogirth conditions.
Discret. Appl. Math.
Xiaoxiao Qin, Fangyu Zhao, Hong-Jian Lai, Bofeng Huo
2025 J jnl
The list r-hued coloring of Halin graph.
Discret. Appl. Math.
Shudan Lu, Fengxia Liu, Hong-Jian Lai
2025 J jnl
The matching-connectivity of a graph.
Discret. Appl. Math.
Hengzhe Li, Menghan Ma, Shuli Zhao, Xiao Zhao, Xiaohui Hua, Yingbin Ma, Hong-Jian Lai
2025 J jnl
The r-hued coloring of K4(7)-minor free graphs.
Discret. Appl. Math.
Jiani Zou, Miaomiao Han, Hong-Jian Lai
2025 J jnl
Two problems on Laplacian ratios of trees.
Discret. Appl. Math.
Tingzeng Wu, Xiangshuai Dong, Hong-Jian Lai
2024 J jnl
On
Discuss. Math. Graph Theory
Xiaoling Ma, Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou
2024 J jnl
On r-hued coloring of connected P5-free tripartite graphs.
Appl. Math. Comput.
Yaxin Shi, Fengxia Liu, Hong-Jian Lai
2024 J jnl
Spanning connectivity of K1,r-free split graphs.
Discret. Appl. Math.
Wei Xiong, Xing Chen, Yang Wu, Zhifu You, Hong-Jian Lai
2024 J jnl
Spanning trails avoiding and containing given edges.
Discuss. Math. Graph Theory
Lan Lei, Xiaomin Li, Sulin Song, Yikang Xie, Hong-Jian Lai
2024 J jnl
Square coloring of planar graphs with maximum degree at most five.
Discret. Appl. Math.
Jiani Zou, Miaomiao Han, Hong-Jian Lai
2024 J jnl
Squares of graphs are optimally (s,t)-supereulerian.
Discret. Appl. Math.
Yue Yan, Lan Lei, Yang Wu, Hong-Jian Lai
2024 J jnl
Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs.
Discret. Math.
Juan Liu, Hong Yang, Xindong Zhang, Hong-Jian Lai
2024 J jnl
The list r-hued coloring of Km,n.
Discret. Appl. Math.
Meng Tang, Fengxia Liu, Hong-Jian Lai
2023 J jnl
Complete family reduction and spanning connectivity in line graphs.
Discret. Math.
Wei Xiong, Fengxia Liu, Yang Wu, Mingquan Zhan, Hong-Jian Lai
2023 J jnl
Gallai-Ramsey Numbers Involving a Rainbow 4-Path.
Graphs Comb.
Jinyu Zou, Zhao Wang, Hong-Jian Lai, Yaping Mao
2023 J jnl
Hamilton-connected claw-free graphs with Ore-degree conditions.
Discret. Appl. Math.
Xia Liu, Hong-Jian Lai
2023 J jnl
On hamiltonian properties of
Discret. Math.
Xia Liu, Sulin Song, Mingquan Zhan, Hong-Jian Lai
2023 J jnl
On list
Appl. Math. Comput.
Lingmei Liang, Fengxia Liu, Hong-Jian Lai
2023 J jnl
On the Linear Arboricity of Graphs with Treewidth at Most Four.
Graphs Comb.
Hong-Yu Chen, Hong-Jian Lai
2023 J jnl
On the sizes of (k, l)-edge-maximal r-uniform hypergraphs.
Discuss. Math. Graph Theory
Yingzhi Tian, Hong-Jian Lai, Jixiang Meng, Murong Xu
2023 J jnl
Supereulerian regular matroids without small cocircuits.
J. Graph Theory
Bofeng Huo, Qingsong Du, Ping Li, Yang Wu, Jun Yin, Hong-Jian Lai
2023 J jnl
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs.
Discret. Appl. Math.
Hui Zhang, Rong-Xia Hao, Hong-Jian Lai, Jaeun Lee
2022 J jnl
Asymptotically sharpening the $s$-Hamiltonian index bound.
Discret. Math. Theor. Comput. Sci.
Sulin Song, Lan Lei, Yehong Shao, Hong-Jian Lai
2022 J jnl
Bounding ℓ-edge-connectivity in edge-connectivity.
Discret. Appl. Math.
Xiaoxia Lin, Keke Wang, Meng Zhang, Hong-Jian Lai
2022 J jnl
Graph r-hued colorings - A survey.
Discret. Appl. Math.
Ye Chen, Suohai Fan, Hong-Jian Lai, Murong Xu
2022 J jnl
Hamiltonian
Discret. Math.
Ruifang Liu, Hong-Jian Lai, Rao Li
2022 J jnl
Hamiltonian index of directed multigraph.
Appl. Math. Comput.
Juan Liu, Shupeng Li, Xindong Zhang, Hong-Jian Lai
2022 J jnl
Hamiltonian line graphs with local degree conditions.
Discret. Math.
Xia Liu, Sulin Song, Hong-Jian Lai
2022 J jnl
Local Optimality of Mixed Reliability for Several Classes of Networks with Fixed Sizes.
Axioms
Lixin Dong, Haixing Zhao, Hong-Jian Lai
2022 J jnl
Modulo orientations and matchings in graphs.
Discret. Math.
Jianbing Liu, Miaomiao Han, Hong-Jian Lai
2022 J jnl
On hamiltonian line graphs of hypergraphs.
J. Graph Theory
Xiaofeng Gu, Hong-Jian Lai, Sulin Song
2022 J jnl
On r-hued list coloring of K4(7)-minor free graphs.
Discret. Appl. Math.
Wenjuan Wei, Fengxia Liu, Wei Xiong, Hong-Jian Lai
2022 J jnl
On the
Discret. Math.
Aimei Yu, Ping Li, Yang Wu, Hong-Jian Lai
2022 J jnl
On the extended Clark-Wormold Hamiltonian-like index problem.
Discret. Math.
Lan Lei, Wei Xiong, Yikang Xie, Mingquan Zhan, Hong-Jian Lai
2022 J jnl
Strengthened Ore conditions for (s, t)-supereulerian graphs.
Discret. Appl. Math.
Lan Lei, Xiaoming Li, Yang Wu, Taoye Zhang, Hong-Jian Lai
2022 J jnl
The Extremal Sizes of Arc-Maximal (k, l)-Digraphs.
Graphs Comb.
Liqiong Xu, Hong-Jian Lai, Yingzhi Tian, Murong Xu
2022 J jnl
Trail-Connected Digraphs with Given Local Structures.
J. Interconnect. Networks
Juan Liu, Hong Yang, Hong-Jian Lai, Xindong Zhang
2022 J jnl
Weighted Modulo Orientations of Graphs and Signed Graphs.
Electron. J. Comb.
Jianbing Liu, Miaomiao Han, Hong-Jian Lai
2021 J jnl
A Note on Group Colorings and Group Structure.
SIAM J. Discret. Math.
Hong-Jian Lai, Lucian Mazza
2021 J jnl
Edge-disjoint spanning trees and forests of graphs.
Discret. Appl. Math.
Jiang Zhou, Changjiang Bu, Hong-Jian Lai
2021 J jnl
Group Colorings and DP-Colorings of Multigraphs Using Edge-Disjoint Decompositions.
Graphs Comb.
Hong-Jian Lai, Lucian Mazza
2021 J jnl
Induced subgraphs of product graphs and a generalization of Huang's theorem.
J. Graph Theory
Zhen-Mu Hong, Hong-Jian Lai, Jianbing Liu
2021 J jnl
Matching and spanning trails in digraphs.
Discret. Appl. Math.
Juan Liu, Omaema Lasfar, Jia Wei, Xindong Zhang, Hong-Jian Lai
2021 J jnl
On (s, t)-supereulerian graphs with linear degree bounds.
Discret. Math.
Lan Lei, Wei Xiong, Yikang Xie, Mingquan Zhan, Hong-Jian Lai
2021 J jnl
On s-hamiltonicity of net-free line graphs.
Discret. Math.
Xiaoling Ma, Yang Wu, Mingquan Zhan, Hong-Jian Lai
2021 J jnl
On the line graph of a graph with diameter 2.
Discret. Math.
Xiaoling Ma, Lan Lei, Hong-Jian Lai, Mingquan Zhan
2021 J jnl
Polynomially determine if a graph is (
Discret. Math.
Wei Xiong, Sulin Song, Hong-Jian Lai
2021 J jnl
Polynomially determining spanning connectivity of locally connected line graphs.
Discret. Appl. Math.
Wei Xiong, Sulin Song, Yikang Xie, Mingquan Zhan, Hong-Jian Lai
2021 J jnl
Strongly Spanning Trailable Graphs with Small Circumference and Hamilton-Connected Claw-Free Graphs.
Graphs Comb.
Xia Liu, Liming Xiong, Hong-Jian Lai
2021 J jnl
Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree.
Graphs Comb.
Mansour J. Algefari, Hong-Jian Lai
2021 J jnl
Symmetric core and spanning trails in directed networks.
Discret. Math.
Juan Liu, Hong Yang, Hong-Jian Lai, Xindong Zhang
2021 J jnl
Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube.
Appl. Math. Comput.
Ruichao Niu, Min Xu, Hong-Jian Lai
2020 J jnl
A characterization of graphs with supereulerian line graphs.
Int. J. Comput. Math. Comput. Syst. Theory
Yufei Huang, Weihua He, Guixian Huang, Hong-Jian Lai, Sulin Song
2020 J jnl
Catlin's reduced graphs with small orders.
AKCE Int. J. Graphs Comb.
Hong-Jian Lai, Keke Wang, Xiaowei Xie, Mingquan Zhan
2020 J jnl
Contractible graphs for flow index less than three.
Discret. Math.
Miaomiao Han, Hong-Jian Lai, Jiaao Li, Yezhou Wu
2020 J jnl
Decomposition and
Appl. Math. Comput.
Ye Chen, Suohai Fan, Hong-Jian Lai, Huimin Song, Murong Xu
2020 J jnl
On the extremal sizes of maximal graphs without (k+1)-connected subgraphs.
Discret. Appl. Math.
Liqiong Xu, Hong-Jian Lai, Yingzhi Tian
2020 J jnl
On the sizes of bi-k-maximal graphs.
J. Comb. Optim.
Liqiong Xu, Yingzhi Tian, Hong-Jian Lai
2020 J jnl
On weighted modulo orientation of graphs.
Eur. J. Comb.
Jian-Bing Liu, Ping Li, Jiaao Li, Hong-Jian Lai
2020 J jnl
Pancyclicity of 4-connected claw-free net-free graphs.
Australas. J Comb.
Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou
2020 J jnl
Unified Spectral Hamiltonian Results of Balanced Bipartite Graphs and Complementary Graphs.
Graphs Comb.
Muhuo Liu, Yang Wu, Hong-Jian Lai
2019 J jnl
Characterizations of matroids with an element lying in a restricted number of circuits.
J. Comb. Optim.
Ping Li, Lan Wang, Yang Wu, Hong-Jian Lai
2019 J jnl
Collapsible subgraphs of a 4-edge-connected graph.
Discret. Appl. Math.
Ran Gu, Hong-Jian Lai, Yanting Liang, Zhengke Miao, Meng Zhang
2019 J jnl
Modulo 5-orientations and degree sequences.
Discret. Appl. Math.
Miaomiao Han, Hong-Jian Lai, Jianping Liu
2019 J jnl
Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs.
Discret. Math.
Yingzhi Tian, Hong-Jian Lai, Liqiong Xu, Jixiang Meng
2019 J jnl
On r-hued colorings of graphs without short induced paths.
Discret. Math.
Hong-Jian Lai, Xuezheng Lv, Murong Xu
2019 J jnl
On s-hamiltonian line graphs of claw-free graphs.
Discret. Math.
Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou
2019 J jnl
On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs.
Graphs Comb.
Yingzhi Tian, Hong-Jian Lai, Jixiang Meng
2019 J jnl
Packing spanning trees in highly essentially connected graphs.
Discret. Math.
Hong-Jian Lai, Jiaao Li
2019 J jnl
Pancyclicity of 4-Connected { K
Graphs Comb.
Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou
2019 J jnl
Spectral analogues of Erdős' theorem on Hamilton-connected graphs.
Appl. Math. Comput.
Jia Wei, Zhifu You, Hong-Jian Lai
2019 J jnl
Spectral results on Hamiltonian problem.
Discret. Math.
Muhuo Liu, Hong-Jian Lai, Kinkar Chandra Das
2019 J jnl
Vertex-connectivity and eigenvalues of graphs with fixed girth.
Appl. Math. Comput.
Ruifang Liu, Hong-Jian Lai, Yingzhi Tian, Yang Wu
2018 J jnl
A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs.
Discret. Math.
Xiaofeng Gu, Hong-Jian Lai
2018 J jnl
An O(log
IEEE Trans. Reliab.
Mingzu Zhang, Lianzhu Zhang, Xing Feng, Hong-Jian Lai
2018 J jnl
Connectivity keeping stars or double-stars in 2-connected graphs.
Discret. Math.
Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Liqiong Xu
2018 J jnl
Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral.
Graphs Comb.
Tingzeng Wu, Hong-Jian Lai
2018 J jnl
Degree sum and hamiltonian-connected line graphs.
Discret. Math.
Jianping Liu, Aimei Yu, Keke Wang, Hong-Jian Lai
2018 J jnl
Linear list r-hued colorings of graphs with bounded maximum subgraph average degrees.
Ars Comb.
Jiangxu Kong, Suohai Fan, Hong-Jian Lai, Murong Xu
2018 J jnl
List r-hued chromatic number of graphs with bounded maximum average degrees.
Discret. Math.
Huimin Song, Hong-Jian Lai, Jianliang Wu
2018 J jnl
Locally dense supereulerian digraphs.
Discret. Appl. Math.
Mansour J. Algefari, Hong-Jian Lai, Jinquan Xu
2018 J jnl
Minimax properties of some density measures in graphs and digraphs.
Int. J. Comput. Math. Comput. Syst. Theory
Janet Anderson, Hong-Jian Lai, Xiaomin Li, Xiaoxia Lin, Murong Xu
2018 J jnl
Mod (2p+1)-Orientation on Bipartite Graphs and Complementary Graphs.
SIAM J. Discret. Math.
Jiaao Li, Xinmin Hou, Miaomiao Han, Hong-Jian Lai
2018 J jnl
Modulo orientations with bounded independence number.
Discret. Appl. Math.
Miaomiao Han, Hong-Jian Lai, Jiaao Li
2018 J jnl
Nowhere-zero 3-flow and -connectedness in graphs with four edge-disjoint spanning trees.
J. Graph Theory
Miaomiao Han, Hong-Jian Lai, Jiaao Li
2018 J jnl
On the permanental sum of graphs.
Appl. Math. Comput.
Tingzeng Wu, Hong-Jian Lai
2018 J jnl
Sensitivity of r-hued colouring of graphs.
Int. J. Comput. Math. Comput. Syst. Theory
Huimin Song, Lianying Miao, Zhengke Miao, Hong-Jian Lai
2018 J jnl
Strongly Spanning Trailable Graphs with Short Longest Paths.
Ars Comb.
Ping Li, Keke Wang, Mingquan Zhan, Hong-Jian Lai
2018 J jnl
Supereulerian bipartite digraphs.
J. Graph Theory
Xindong Zhang, Juan Liu, Lan Wang, Hong-Jian Lai
2018 J jnl
The connectivity of generalized graph products.
Inf. Process. Lett.
Xiaomin Li, Lan Lei, Hong-Jian Lai
2018 J jnl
Upper bounds of r-hued colorings of planar graphs.
Discret. Appl. Math.
Huimin Song, Hong-Jian Lai
2018 J jnl
r-hued coloring of sparse graphs.
Discret. Appl. Math.
Jian Cheng, Hong-Jian Lai, Kate J. Lorenzen, Rong Luo, Joshua C. Thompson, Cun-Quan Zhang
2017 J jnl
3-dynamic coloring and list 3-dynamic coloring of K
Discret. Appl. Math.
Hao Li, Hong-Jian Lai
2017 J jnl
Characterization of Digraphic Sequences with Strongly Connected Realizations.
J. Graph Theory
Yanmei Hong, Qinghai Liu, Hong-Jian Lai
2017 J jnl
Characterizations of k-cutwidth critical trees.
J. Comb. Optim.
Zhen-Kun Zhang, Hong-Jian Lai
2017 J jnl
Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees.
SIAM J. Discret. Math.
Jiaao Li, Hong-Jian Lai, Rong Luo
2017 J jnl
Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs.
J. Comb. Theory B
Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong
2017 J jnl
On
J. Graph Theory
Janet Anderson, Hong-Jian Lai, Xiaoxia Lin, Murong Xu
2017 J jnl
Panconnected index of graphs.
Discret. Math.
Hao Li, Hong-Jian Lai, Yang Wu, Shuzhen Zhu
2017 J jnl
Spanning trails with variations of Chvátal-Erdős conditions.
Discret. Math.
Zhi-Hong Chen, Hong-Jian Lai, Meng Zhang
2017 J jnl
Supereulerian width of dense graphs.
Discret. Math.
Wei Xiong, Jinquan Xu, Zhengke Miao, Yang Wu, Hong-Jian Lai
2016 J jnl
Algorithm for constraint partial inverse matroid problem with weight increase forbidden.
Theor. Comput. Sci.
Shuangshuang Li, Zhao Zhang, Hong-Jian Lai
2016 J jnl
Algorithms for the partial inverse matroid problem in which weights can only be increased.
J. Glob. Optim.
Zhao Zhang, Shuangshuang Li, Hong-Jian Lai, Ding-Zhu Du
2016 J jnl
Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs.
J. Graph Theory
Xiaofeng Gu, Hong-Jian Lai, Ping Li, Senmei Yao
2016 J jnl
Element deletion changes in dynamic coloring of graphs.
Discret. Math.
Lianying Miao, Hong-Jian Lai, Yan-Fang Guo, Zhengke Miao
2016 J jnl
Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations.
Graphs Comb.
Yanting Liang, Hong-Jian Lai, Rong Luo, Rui Xu
2016 J jnl
Fractional spanning tree packing, forest covering and eigenvalues.
Discret. Appl. Math.
Yanmei Hong, Xiaofeng Gu, Hong-Jian Lai, Qinghai Liu
2016 J jnl
On Perfect Matching Coverings and Even Subgraph Coverings.
J. Graph Theory
Xinmin Hou, Hong-Jian Lai, Cun-Quan Zhang
2016 J jnl
On dense strongly Z
Discret. Math.
Aimei Yu, Jianping Liu, Miaomiao Han, Hong-Jian Lai
2016 J jnl
On group choosability of graphs, I.
Ars Comb.
H. Chuang, Hong-Jian Lai, G. R. Omidi, Niloufar Zakeri
2016 J jnl
On r-hued coloring of planar graphs with girth at least 6.
Discret. Appl. Math.
Huimin Song, Hong-Jian Lai, Jian-Liang Wu
2016 J jnl
On the lower bound of k-maximal digraphs.
Discret. Math.
Xiaoxia Lin, Suohai Fan, Hong-Jian Lai, Murong Xu
2016 J jnl
Ore-type degree condition of supereulerian digraphs.
Discret. Math.
Yanmei Hong, Qinghai Liu, Hong-Jian Lai
2016 J jnl
Supereulerian Digraphs with Large Arc-Strong Connectivity.
J. Graph Theory
Mansour J. Algefari, Hong-Jian Lai
2016 J jnl
Supereulerian digraphs with given local structures.
Inf. Process. Lett.
Mansour J. Algefari, Khalid A. Alsatami, Hong-Jian Lai, Juan Liu
2016 J jnl
Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs.
Discret. Appl. Math.
Xiaoling Ma, Hong-Jian Lai, Wei Xiong, Baoyingdureng Wu, Xinhui An
2016 J jnl
Supereulerian graphs with width s and s-collapsible graphs.
Discret. Appl. Math.
Ping Li, Hao Li, Ye Chen, Herbert Fleischner, Hong-Jian Lai
2015 J jnl
Degree sequence realizations with given packing and covering of spanning trees.
Discret. Appl. Math.
Fengxia Liu, Zhao Zhang, Hong-Jian Lai, Meng Zhang
2015 J jnl
Graphs with a 3-Cycle-2-Cover.
Graphs Comb.
Zhi-Hong Chen, Miaomiao Han, Hong-Jian Lai, Mingquan Zhan
2015 J jnl
K
Ars Comb.
Hong-Jian Lai, Yehong Shao, Mingquan Zhan
2014 J jnl
Bounds of eigenvalues of a nontrivial bipartite graph.
Ars Comb.
Hong-Jian Lai, Bolian Liu, Ju Zhou
2014 J jnl
Characterizations of Strength Extremal Graphs.
Graphs Comb.
Xiaofeng Gu, Hong-Jian Lai, Ping Li, Senmei Yao
2014 J jnl
Collapsible Graphs and Hamiltonicity of Line Graphs.
Graphs Comb.
Weihua Yang, Hong-Jian Lai, Hao Li, Xiaofeng Guo
2014 J jnl
On Group Choosability of Graphs, II.
Graphs Comb.
H. Chuang, Hong-Jian Lai, G. R. Omidi, K. Wang, Niloufar Zakeri
2014 J jnl
On Mod (2s+1)-Orientations of Graphs.
SIAM J. Discret. Math.
Ping Li, Hong-Jian Lai
2014 J jnl
On extremal k-supereulerian graphs.
Discret. Math.
Zhaohong Niu, Liang Sun, Liming Xiong, Hong-Jian Lai, Huiya Yan
2014 J jnl
On r-hued coloring of K
Discret. Math.
Huimin Song, Suohai Fan, Ye Chen, Lei Sun, Hong-Jian Lai
2014 J jnl
On strongly Z
Discret. Appl. Math.
Hong-Jian Lai, Yanting Liang, Juan Liu, Jixiang Meng, Zhengke Miao, Yehong Shao, Zhao Zhang
2014 J jnl
On the existence of super edge-connected graphs with prescribed degrees.
Discret. Math.
Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Zhao Zhang
2014 J jnl
Realizing degree sequences as Z
Discret. Math.
Fan Yang, Xiangwen Li, Hong-Jian Lai
2014 J jnl
Spanning 3-connected index of graphs.
J. Comb. Optim.
Wei Xiong, Zhao Zhang, Hong-Jian Lai
2014 J jnl
Spanning trails in essentially 4-edge-connected graphs.
Discret. Appl. Math.
Jinquan Xu, Zhi-Hong Chen, Hong-Jian Lai, Meng Zhang
2014 J jnl
Supereulerian digraphs.
Discret. Math.
Yanmei Hong, Hong-Jian Lai, Qinghai Liu
2014 J jnl
Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs.
Int. J. Comput. Math.
Jinquan Xu, Ping Li, Zhengke Miao, Keke Wang, Hong-Jian Lai
2013 J jnl
Analytical Solution of Steady-State Equations for Chemical Reaction Networks with Bilinear Rate Laws.
IEEE ACM Trans. Comput. Biol. Bioinform.
Ádám M. Halász, Hong-Jian Lai, Meghan McCabe Pryor, Krishnan Radhakrishnan, Jeremy S. Edwards
2013 J jnl
Group colorability of multigraphs.
Discret. Math.
Hao Li, Hong-Jian Lai
2013 J jnl
Hamilton cycles in 3-connected claw-free and net-free graphs.
Discret. Math.
Wei Xiong, Hong-Jian Lai, Xiaoling Ma, Keke Wang, Meng Zhang
2013 J jnl
Non-separating subgraphs.
Discret. Math.
Yanmei Hong, Hong-Jian Lai
2013 J jnl
On
J. Graph Theory
Hong-Jian Lai, Yehong Shao
2013 J jnl
On Group Choosability of Total Graphs.
Graphs Comb.
Hong-Jian Lai, G. R. Omidi, Ghaffar Raeisi
2013 J jnl
On Spanning Disjoint Paths in Line Graphs.
Graphs Comb.
Ye Chen, Zhi-Hong Chen, Hong-Jian Lai, Ping Li, Erling Wei
2013 J jnl
Realizing degree sequences with
Discret. Math.
Xiaofeng Gu, Hong-Jian Lai
2012 J jnl
A dual version of the Brooks group coloring theorem.
Discret. Math.
Deying Li, Suohai Fan, Hong-Jian Lai, Senmei Yao
2012 J jnl
Characterization of removable elements with respect to having k disjoint bases in a matroid.
Discret. Appl. Math.
Ping Li, Hong-Jian Lai, Yanting Liang
2012 J jnl
Collapsible graphs and Hamiltonian connectedness of line graphs.
Discret. Appl. Math.
Weihua Yang, Hong-Jian Lai, Hao Li, Xiaofeng Guo
2012 J jnl
Degree condition and Z
Discret. Math.
Xiangwen Li, Hong-Jian Lai, Yehong Shao
2012 J jnl
Group connectivity of complementary graphs.
J. Graph Theory
Xinmin Hou, Hong-Jian Lai, Ping Li, Cun-Quan Zhang
2012 J jnl
Hamiltonian graphs involving neighborhood conditions.
Ars Comb.
Kewen Zhao, Lili Zhang, Hong-Jian Lai, Yehong Shao
2012 J jnl
Hamiltonicity of 3-connected line graphs.
Appl. Math. Lett.
Weihua Yang, Liming Xiong, Hong-Jian Lai, Xiaofeng Guo
2012 J jnl
Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees.
Appl. Math. Lett.
Xiaofeng Gu, Hong-Jian Lai, Yanting Liang
2012 J jnl
On 3-connected hamiltonian line graphs.
Discret. Math.
Ye Chen, Suohai Fan, Hong-Jian Lai
2012 J jnl
On dynamic coloring for planar graphs and graphs of higher genus.
Discret. Appl. Math.
Ye Chen, Suohai Fan, Hong-Jian Lai, Huimin Song, Lei Sun
2012 J jnl
Spanning Eulerian Subgraphs in Generalized Prisms.
Ars Comb.
Xiaomin Li, Dengxin Li, Hong-Jian Lai
2012 J jnl
Spanning cycles in regular matroids without small cocircuits.
Eur. J. Comb.
Ping Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan
2012 J jnl
Spanning subgraph with Eulerian components.
Discret. Math.
Zhaohong Niu, Hong-Jian Lai, Liming Xiong
2012 J jnl
The Connectivity and Diameter of Second Order Circuit Graphs of Matroids.
Graphs Comb.
Jinquan Xu, Ping Li, Hong-Jian Lai
2012 J jnl
Z
Eur. J. Comb.
Xinmin Hou, Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou
2011 J jnl
Characterization of minimally (2,
Inf. Process. Lett.
Xiaofeng Gu, Hong-Jian Lai, Senmei Yao
2011 J jnl
Degree sequences and graphs with disjoint spanning trees.
Discret. Appl. Math.
Hong-Jian Lai, Yanting Liang, Ping Li, Jinquan Xu
2011 J jnl
Every N
Discret. Math. Algorithms Appl.
Erling Wei, Ye Chen, Ping Li, Hong-Jian Lai
2011 J jnl
Group connectivity in line graphs.
Discret. Math.
Hong-Jian Lai, Hao Li, Ping Li, Yanting Liang, Senmei Yao
2011 J jnl
Mod (2p+1)-orientations in line graphs.
Inf. Process. Lett.
Hong-Jian Lai, Hao Li, Ping Li, Yanting Liang, Senmei Yao
2011 J jnl
Obstructions to a binary matroid being graphic.
Eur. J. Comb.
Hong-Jian Lai, Manoel Lemos, Talmage James Reid, Yehong Shao, Haidong Wu
2011 J jnl
On 3-Edge-Connected Supereulerian Graphs.
Graphs Comb.
Hong-Jian Lai, Hao Li, Yehong Shao, Mingquan Zhan
2011 J jnl
Supereulerian graphs and matchings.
Appl. Math. Lett.
Hong-Jian Lai, Huiya Yan
2011 J jnl
Supereulerian graphs in the graph family C
Discret. Appl. Math.
Hong-Jian Lai, Yanting Liang
2010 J jnl
Balanced and 1-balanced graph constructions.
Discret. Appl. Math.
Arthur M. Hobbs, Lavanya Kannan, Hong-Jian Lai, Hongyuan Lai, Guoqing Weng
2010 J jnl
Degree conditions for group connectivity.
Discret. Math.
Xiangjuan Yao, Xiangwen Li, Hong-Jian Lai
2010 J jnl
Degree sum condition for Z
Discret. Math.
Xiaoxia Zhang, Mingquan Zhan, Rui Xu, Yehong Shao, Xiangwen Li, Hong-Jian Lai
2010 — conf
Emergence of Specialization in a Swarm of Robots.
DARS
Ádám M. Halász, Yanting Liang, M. Ani Hsieh, Hong-Jian Lai
2010 J jnl
Every 3-connected claw-free
J. Graph Theory
Hong-Jian Lai, Liming Xiong, Huiya Yan, Jin Yan
2010 J jnl
On (s, t)-supereulerian graphs in locally highly connected graphs.
Discret. Math.
Lan Lei, Xiao-Min Li, Bin Wang, Hong-Jian Lai
2010 J jnl
On 3-edge-connected supereulerian graphs in graph family C(l, k).
Discret. Math.
Xiaomin Li, Dengxin Li, Hong-Jian Lai
2010 J jnl
Spanning eulerian subgraphs in N
Ars Comb.
Hong-Jian Lai, Mingchu Li, Yehong Shao, Liming Xiong
2010 J jnl
The Chvátal-Erdös condition for supereulerian graphs and the Hamiltonian index.
Discret. Math.
Longsheng Han, Hong-Jian Lai, Liming Xiong, Huiya Yan
2009 J jnl
Edge-connectivity and edge-disjoint spanning trees.
Discret. Math.
Paul A. Catlin, Hong-Jian Lai, Yehong Shao
2009 J jnl
Every line graph of a 4-edge-connected graph is
Eur. J. Comb.
Hong-Jian Lai, Lianying Miao, Yehong Shao
2009 J jnl
Hamilton-connected indices of graphs.
Discret. Math.
Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan, Mingquan Zhan
2009 J jnl
Hamiltonian connectedness in 3-connected line graphs.
Discret. Appl. Math.
Hong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan
2009 Misc conf
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs.
FAW
Xiaofeng Gu, Kamesh Madduri, K. Subramani, Hong-Jian Lai
2009 J jnl
On mod (2p+1)-orientations of graphs.
J. Comb. Theory B
Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou
2009 J jnl
Random walks for selected boolean implication and equivalence problems.
Acta Informatica
K. Subramani, Hong-Jian Lai, Xiaofeng Gu
2009 J jnl
Reinforcing the number of disjoint spanning trees.
Ars Comb.
Damin Liu, Hong-Jian Lai, Zhi-Hong Chen
2009 J jnl
The supereulerian graphs in the graph family C(l, k).
Discret. Math.
Xiaomin Li, Dengxin Li, Hong-Jian Lai
2009 J jnl
Transforming a graph into a 1-balanced graph.
Discret. Appl. Math.
Lavanya Kannan, Arthur M. Hobbs, Hong-Jian Lai, Hongyuan Lai
2008 J jnl
Degree sequence and supereulerian graphs.
Discret. Math.
Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhang, Ju Zhou
2008 J jnl
Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected.
Discret. Math.
Hong-Jian Lai, Yehong Shao, Mingquan Zhan
2008 J jnl
Group connectivity of certain graphs.
Ars Comb.
Jingjing Chen, Elaine M. Eschen, Hong-Jian Lai
2008 J jnl
Hamiltonian connected hourglass free line graphs.
Discret. Math.
Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan
2008 J jnl
Hamiltonian-connected graphs.
Comput. Math. Appl.
Kewen Zhao, Hong-Jian Lai, Ju Zhou
2008 J jnl
New Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs.
Ars Comb.
Yan Jin, Kewen Zhao, Hong-Jian Lai, Ju Zhou
2008 J jnl
Nowhere-zero 3-flows in triangularly connected graphs.
J. Comb. Theory B
Genghua Fan, Hong-Jian Lai, Rui Xu, Cun-Quan Zhang, Chuixiang Zhou
2008 J jnl
On Group Connectivity of Graphs.
Graphs Comb.
Hong-Jian Lai, Rui Xu, Ju Zhou
2008 J jnl
On s-hamiltonian-connected line graphs.
Discret. Math.
Hong-Jian Lai, Yanting Liang, Yehong Shao
2008 J jnl
Spanning cycles in regular matroids without M
Eur. J. Comb.
Hong-Jian Lai, Bolian Liu, Yan Liu, Yehong Shao
2008 J jnl
The s-Hamiltonian index.
Discret. Math.
Zhang Lili, Elaine M. Eschen, Hong-Jian Lai, Yehong Shao
2007 J jnl
An
Graphs Comb.
Zhi-Hong Chen, Hong-Jian Lai, Wai-Chee Shiu, Deying Li
2007 J jnl
An inequality for the group chromatic number of a graph.
Discret. Math.
Hong-Jian Lai, Xiangwen Li, Gexin Yu
2007 J jnl
Erratum to "Collapsible biclaw-free graphs": [Discrete Math 306 (2006) 2115-2117].
Discret. Math.
Hong-Jian Lai, Xiangjuan Yao
2007 Misc conf
Hamiltonian Connected Line Graphs.
International Conference on Computational Science (3)
Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan
2007 J jnl
Mod (2p + 1)-Orientations and $K
SIAM J. Discret. Math.
Hong-Jian Lai
2007 J jnl
New sufficient condition for Hamiltonian graphs.
Appl. Math. Lett.
Kewen Zhao, Hong-Jian Lai, Yehong Shao
2007 J jnl
On Circular Flows Of Graphs.
Comb.
Hong-Jian Lai, Rui Xu, Cun-Quan Zhang
2007 J jnl
Quadrangularly connected claw-free graphs.
Discret. Math.
Mingchu Li, Cheng Guo, Liming Xiong, Dengxin Li, Hong-Jian Lai
2006 J jnl
Collapsible biclaw-free graphs.
Discret. Math.
Hong-Jian Lai, Xiangjuan Yao
2006 J jnl
Conditional colorings of graphs.
Discret. Math.
Hong-Jian Lai, Jianliang Lin, Bruce Montgomery, Taozhi Shui, Suohai Fan
2006 J jnl
Every 3-connected, essentially 11-connected line graph is Hamiltonian.
J. Comb. Theory B
Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou
2006 J jnl
Group chromatic number of planar graphs of girth at least 4.
J. Graph Theory
Hong-Jian Lai, Xiangwen Li
2006 J jnl
Group connectivity of graphs with diameter at most 2.
Eur. J. Comb.
Hong-Jian Lai, Xiangjuan Yao
2006 J jnl
Hamiltonicity in 3-connected claw-free graphs.
J. Comb. Theory B
Hong-Jian Lai, Yehong Shao, Mingquan Zhan
2005 J jnl
Eulerian subgraphs and Hamilton-connected line graphs.
Discret. Appl. Math.
Dengxin Li, Hong-Jian Lai, Mingquan Zhan
2005 J jnl
Hamiltonian
J. Graph Theory
Hong-Jian Lai, Yehong Shao, Mingquan Zhan
2005 J jnl
Nowhere zero 4-flow in regular matroids.
J. Graph Theory
Hong-Jian Lai, Xiangwen Li, Hoifung Poon
2005 J jnl
On Group Chromatic Number of Graphs.
Graphs Comb.
Hong-Jian Lai, Xiangwen Li
2005 J jnl
Spanning Trails Connecting Given Edges.
Graphs Comb.
Hong-Jian Lai, Xiangwen Li, Hoifung Poon, Yongbin Ou
2005 J jnl
Supereulerian planar graphs.
Ars Comb.
Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan Zhan
2004 J jnl
Generalized honeycomb torus is Hamiltonian.
Inf. Process. Lett.
Xiaofan Yang, David J. Evans, Hong-Jian Lai, Graham M. Megson
2004 J jnl
Global asymptotic stability in a rational recursive sequence.
Appl. Math. Comput.
Xiaofan Yang, Hong-Jian Lai, David J. Evans, Graham M. Megson
2004 J jnl
On the maximal connected component of hypercube with faulty vertices.
Int. J. Comput. Math.
Xiaofan Yang, David J. Evans, Bill Chen, Graham M. Megson, Hong-Jian Lai
2003 J jnl
Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs.
J. Graph Theory
Zhi-Hong Chen, Hong-Jian Lai, Xiangwen Li, Deying Li, Jingzhong Mao
2003 J jnl
Minimally (
J. Graph Theory
Kamal Hennayake, Hong-Jian Lai, Deying Li, Jingzhong Mao
2003 J jnl
Nowhere-zero 3-flows in locally connected graphs.
J. Graph Theory
Hong-Jian Lai
2003 J jnl
Small cycle cover of 2-connected cubic graphs.
Discret. Math.
Hong-Jian Lai, Xiangwen Li
2003 J jnl
Upper Bounds of Dynamic Chromatic Number.
Ars Comb.
Hong-Jian Lai, Bruce Montgomery, Hoifung Poon
2002 J jnl
Cycle Cover Ratio of Regular Matroids.
Eur. J. Comb.
Hong-Jian Lai, Hoifung Poon
2002 J jnl
Group Chromatic Number of Graphs without K
Graphs Comb.
Hong-Jian Lai, Xiankun Zhang
2002 J jnl
Group Colorability of Graphs.
Ars Comb.
Hong-Jian Lai, Xiankun Zhang
2001 J jnl
Dedication.
Discret. Math.
Arthur M. Hobbs, Hong-Jian Lai
2001 J jnl
Eulerian subgraphs containing given edges.
Discret. Math.
Hong-Jian Lai
2001 J jnl
Graph family operations.
Discret. Math.
Paul A. Catlin, Arthur M. Hobbs, Hong-Jian Lai
2001 J jnl
Hamilton weights and Petersen minors.
J. Graph Theory
Hong-Jian Lai, Cun-Quan Zhang
2001 J jnl
Line Graphs and Forbidden Induced Subgraphs.
J. Comb. Theory B
Hong-Jian Lai, Lubomír Soltés
2001 J jnl
Nowhere zero flows in line graphs.
Discret. Math.
Zhi-Hong Chen, Hong-Jian Lai, Hongyuan Lai
2001 J jnl
Paul Catlin 1948-1995.
Discret. Math.
Arthur M. Hobbs, Hong-Jian Lai, Neil Robertson
2000 J jnl
Group Connectivity of 3-Edge-Connected Chordal Graphs.
Graphs Comb.
Hong-Jian Lai
2000 J jnl
Spanning trails that join given edges in 3-edge-connected graphs.
Ars Comb.
Hong-Jian Lai, Xiankun Zhang
1999 J jnl
Connectivity of cycle matroids and bicircular matroids.
Ars Comb.
Zhi-Hong Chen, Kuang Ying-Qiang, Hong-Jian Lai
1999 J jnl
Extending a partial nowhere-zero 4-flow.
J. Graph Theory
Hong-Jian Lai
1998 J jnl
Eulerian subgraphs containing given vertices and hamiltonian line graphs.
Discret. Math.
Hong-Jian Lai
1998 J jnl
Supereulerian graphs and the Petersen Graph, II.
Ars Comb.
Zhi-Hong Chen, Hong-Jian Lai
1996 J jnl
A Property on Edge-disjoint Spanning Trees.
Eur. J. Comb.
Hong-Jian Lai, Hongyuan Lai, Charles Payan
1996 J jnl
Graphs without spanning closed trails.
Discret. Math.
Paul A. Catlin, Zheng-Yiao Han, Hong-Jian Lai
1996 J jnl
Supereulerian Graphs and the Petersen Graph.
J. Comb. Theory B
Paul A. Catlin, Hong-Jian Lai
1995 J jnl
Every Matroid Is a Submatroid of a Uniformly Dense Matroid.
Discret. Appl. Math.
Hong-Jian Lai, Hongyuan Lai
1995 J jnl
Large Survivable Nets and the Generalized Prisms.
Discret. Appl. Math.
Hong-Jian Lai
1995 J jnl
Strength and fractional arboricity of complementary graphs.
Discret. Math.
Hong-Jian Lai, Guoqing Weng
1995 J jnl
Supereulerian graphs and excluded induced minors.
Discret. Math.
Hong-Jian Lai
1995 J jnl
The size of graphs with given edge inclusive connectivity.
Ars Comb.
Hong-Jian Lai, Hongyuan Lai
1995 J jnl
The size of graphs without nowhere-zero 4-flows.
J. Graph Theory
Hong-Jian Lai
1995 J jnl
Vertex arboricity and maximum degree.
Discret. Math.
Paul A. Catlin, Hong-Jian Lai
1994 J jnl
Edge-maximal (
J. Graph Theory
Hong-Jian Lai, Cun-Quan Zhang
1994 J jnl
Every 4-Connected Line Graph of a Planar Graph is Hamiltonian.
Graphs Comb.
Hong-Jian Lai
1994 J jnl
Small Circuit Double Covers of Cubic Multigraphs.
J. Comb. Theory B
Hong-Jian Lai, Xingxing Yu, Cun-Quan Zhang
1993 J jnl
Collapsible graphs and matchings.
J. Graph Theory
Zhi-Hong Chen, Hong-Jian Lai
1993 J jnl
Supereulerian complementary graphs.
J. Graph Theory
Hong-Jian Lai
1992 J jnl
Duality in graph families.
Discret. Math.
Hong-Jian Lai, Hongyuan Lai
1992 J jnl
Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids.
Discret. Appl. Math.
Paul A. Catlin, Jerrold W. Grossman, Arthur M. Hobbs, Hong-Jian Lai
1992 J jnl
Nowhere-zero 3-flows of highly connected graphs.
Discret. Math.
Hong-Jian Lai, Cun-Quan Zhang
1991 J jnl
Graph whose edges are in small cycles.
Discret. Math.
Hong-Jian Lai
1990 J jnl
Reduced graphs of diameter two.
J. Graph Theory
Hong-Jian Lai
1990 J jnl
The size of strength-maximal graphs.
J. Graph Theory
Hong-Jian Lai
1989 J jnl
Unique graph homomorphisms onto odd cycles, II.
J. Comb. Theory B
Hong-Jian Lai
1988 J jnl
Contractions and hamiltonian line graphs.
J. Graph Theory
Hong-Jian Lai
1988 J jnl
On the Hamiltonian index.
Discret. Math.
Hong-Jian Lai