Hong-Jian Lai

ORCID

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 111

Top Venues

Publications

Yue Yan, Lan Lei, Yang Wu, Hong-Jian Lai
Squares of graphs are optimally (s,t)-supereulerian. Discret. Appl. Math. 359 (2024)
Yaxin Shi, Fengxia Liu, Hong-Jian Lai
On r-hued coloring of connected P5-free tripartite graphs. Appl. Math. Comput. 479 (2024)
Meng Tang, Fengxia Liu, Hong-Jian Lai
The list r-hued coloring of Km,n. Discret. Appl. Math. 348 (2024)
Lan Lei, Xiaomin Li, Sulin Song, Yikang Xie, Hong-Jian Lai
Spanning trails avoiding and containing given edges. Discuss. Math. Graph Theory 44 (4) (2024)
Wei Xiong, Xing Chen, Yang Wu, Zhifu You, Hong-Jian Lai
Spanning connectivity of K1,r-free split graphs. Discret. Appl. Math. 358 (2024)
Juan Liu, Hong Yang, Xindong Zhang, Hong-Jian Lai
Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs. Discret. Math. 347 (4) (2024)
Xiaoling Ma, Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou
-hamiltonian-connected line graphs. Discuss. Math. Graph Theory 44 (1) (2024)
Jiani Zou, Miaomiao Han, Hong-Jian Lai
Square coloring of planar graphs with maximum degree at most five. Discret. Appl. Math. 353 (2024)
Hong-Yu Chen, Hong-Jian Lai
On the Linear Arboricity of Graphs with Treewidth at Most Four. Graphs Comb. 39 (4) (2023)
Lingmei Liang, Fengxia Liu, Hong-Jian Lai
-hued coloring of outer-1-planar graphs. Appl. Math. Comput. 440 (2023)
Wei Xiong, Fengxia Liu, Yang Wu, Mingquan Zhan, Hong-Jian Lai
Complete family reduction and spanning connectivity in line graphs. Discret. Math. 346 (1) (2023)
Bofeng Huo, Qingsong Du, Ping Li, Yang Wu, Jun Yin, Hong-Jian Lai
Supereulerian regular matroids without small cocircuits. J. Graph Theory 102 (1) (2023)
Jinyu Zou, Zhao Wang, Hong-Jian Lai, Yaping Mao
Gallai-Ramsey Numbers Involving a Rainbow 4-Path. Graphs Comb. 39 (3) (2023)
Yingzhi Tian, Hong-Jian Lai, Jixiang Meng, Murong Xu
On the sizes of (k, l)-edge-maximal r-uniform hypergraphs. Discuss. Math. Graph Theory 43 (1) (2023)
Xia Liu, Sulin Song, Mingquan Zhan, Hong-Jian Lai
-free split graphs. Discret. Math. 346 (7) (2023)
Xia Liu, Hong-Jian Lai
Hamilton-connected claw-free graphs with Ore-degree conditions. Discret. Appl. Math. 341 (2023)
Hui Zhang, Rong-Xia Hao, Hong-Jian Lai, Jaeun Lee
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs. Discret. Appl. Math. 338 (2023)
Wenjuan Wei, Fengxia Liu, Wei Xiong, Hong-Jian Lai
On r-hued list coloring of K4(7)-minor free graphs. Discret. Appl. Math. 309 (2022)
Xiaoxia Lin, Keke Wang, Meng Zhang, Hong-Jian Lai
Bounding ℓ-edge-connectivity in edge-connectivity. Discret. Appl. Math. 321 (2022)
Lan Lei, Xiaoming Li, Yang Wu, Taoye Zhang, Hong-Jian Lai
Strengthened Ore conditions for (s, t)-supereulerian graphs. Discret. Appl. Math. 320 (2022)
Jianbing Liu, Miaomiao Han, Hong-Jian Lai
Modulo orientations and matchings in graphs. Discret. Math. 345 (7) (2022)
Xiaofeng Gu, Hong-Jian Lai, Sulin Song
On hamiltonian line graphs of hypergraphs. J. Graph Theory 100 (3) (2022)
Lan Lei, Wei Xiong, Yikang Xie, Mingquan Zhan, Hong-Jian Lai
On the extended Clark-Wormold Hamiltonian-like index problem. Discret. Math. 345 (4) (2022)
Ruifang Liu, Hong-Jian Lai, Rao Li
-connected graphs. Discret. Math. 345 (4) (2022)
Jianbing Liu, Miaomiao Han, Hong-Jian Lai
Weighted Modulo Orientations of Graphs and Signed Graphs. Electron. J. Comb. 29 (4) (2022)
Ye Chen, Suohai Fan, Hong-Jian Lai, Murong Xu
Graph r-hued colorings - A survey. Discret. Appl. Math. 321 (2022)
Sulin Song, Lan Lei, Yehong Shao, Hong-Jian Lai
Asymptotically sharpening the $s$-Hamiltonian index bound. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Juan Liu, Hong Yang, Hong-Jian Lai, Xindong Zhang
Trail-Connected Digraphs with Given Local Structures. J. Interconnect. Networks 22 (1) (2022)
Lixin Dong, Haixing Zhao, Hong-Jian Lai
Local Optimality of Mixed Reliability for Several Classes of Networks with Fixed Sizes. Axioms 11 (3) (2022)
Juan Liu, Shupeng Li, Xindong Zhang, Hong-Jian Lai
Hamiltonian index of directed multigraph. Appl. Math. Comput. 425 (2022)
Liqiong Xu, Hong-Jian Lai, Yingzhi Tian, Murong Xu
The Extremal Sizes of Arc-Maximal (k, l)-Digraphs. Graphs Comb. 38 (3) (2022)
Aimei Yu, Ping Li, Yang Wu, Hong-Jian Lai
-hamiltonianicity of an hourglass-free line graph. Discret. Math. 345 (8) (2022)
Xia Liu, Sulin Song, Hong-Jian Lai
Hamiltonian line graphs with local degree conditions. Discret. Math. 345 (6) (2022)
Hong-Jian Lai, Lucian Mazza
A Note on Group Colorings and Group Structure. SIAM J. Discret. Math. 35 (4) (2021)
Zhen-Mu Hong, Hong-Jian Lai, Jianbing Liu
Induced subgraphs of product graphs and a generalization of Huang's theorem. J. Graph Theory 98 (2) (2021)
Juan Liu, Omaema Lasfar, Jia Wei, Xindong Zhang, Hong-Jian Lai
Matching and spanning trails in digraphs. Discret. Appl. Math. 304 (2021)
Xiaoling Ma, Lan Lei, Hong-Jian Lai, Mingquan Zhan
On the line graph of a graph with diameter 2. Discret. Math. 344 (1) (2021)
Xiaoling Ma, Yang Wu, Mingquan Zhan, Hong-Jian Lai
On s-hamiltonicity of net-free line graphs. Discret. Math. 344 (1) (2021)
Wei Xiong, Sulin Song, Hong-Jian Lai
, 3)-supereulerian. Discret. Math. 344 (12) (2021)
Jiang Zhou, Changjiang Bu, Hong-Jian Lai
Edge-disjoint spanning trees and forests of graphs. Discret. Appl. Math. 299 (2021)
Mansour J. Algefari, Hong-Jian Lai
Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree. Graphs Comb. 37 (1) (2021)
Xia Liu, Liming Xiong, Hong-Jian Lai
Strongly Spanning Trailable Graphs with Small Circumference and Hamilton-Connected Claw-Free Graphs. Graphs Comb. 37 (1) (2021)
Juan Liu, Hong Yang, Hong-Jian Lai, Xindong Zhang
Symmetric core and spanning trails in directed networks. Discret. Math. 344 (11) (2021)
Hong-Jian Lai, Lucian Mazza
Group Colorings and DP-Colorings of Multigraphs Using Edge-Disjoint Decompositions. Graphs Comb. 37 (6) (2021)
Wei Xiong, Sulin Song, Yikang Xie, Mingquan Zhan, Hong-Jian Lai
Polynomially determining spanning connectivity of locally connected line graphs. Discret. Appl. Math. 295 (2021)
Ruichao Niu, Min Xu, Hong-Jian Lai
Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube. Appl. Math. Comput. 400 (2021)
Lan Lei, Wei Xiong, Yikang Xie, Mingquan Zhan, Hong-Jian Lai
On (s, t)-supereulerian graphs with linear degree bounds. Discret. Math. 344 (3) (2021)
Muhuo Liu, Yang Wu, Hong-Jian Lai
Unified Spectral Hamiltonian Results of Balanced Bipartite Graphs and Complementary Graphs. Graphs Comb. 36 (5) (2020)
Miaomiao Han, Hong-Jian Lai, Jiaao Li, Yezhou Wu
Contractible graphs for flow index less than three. Discret. Math. 343 (11) (2020)
Jian-Bing Liu, Ping Li, Jiaao Li, Hong-Jian Lai
On weighted modulo orientation of graphs. Eur. J. Comb. 89 (2020)
Liqiong Xu, Yingzhi Tian, Hong-Jian Lai
On the sizes of bi-k-maximal graphs. J. Comb. Optim. 39 (3) (2020)
Ye Chen, Suohai Fan, Hong-Jian Lai, Huimin Song, Murong Xu
(7)-minor free graphs. Appl. Math. Comput. 384 (2020)
Hong-Jian Lai, Keke Wang, Xiaowei Xie, Mingquan Zhan
Catlin's reduced graphs with small orders. AKCE Int. J. Graphs Comb. 17 (2) (2020)
Yufei Huang, Weihua He, Guixian Huang, Hong-Jian Lai, Sulin Song
A characterization of graphs with supereulerian line graphs. Int. J. Comput. Math. Comput. Syst. Theory 5 (1) (2020)
Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou
Pancyclicity of 4-connected claw-free net-free graphs. Australas. J Comb. 76 (2020)
Liqiong Xu, Hong-Jian Lai, Yingzhi Tian
On the extremal sizes of maximal graphs without (k+1)-connected subgraphs. Discret. Appl. Math. 285 (2020)
Ran Gu, Hong-Jian Lai, Yanting Liang, Zhengke Miao, Meng Zhang
Collapsible subgraphs of a 4-edge-connected graph. Discret. Appl. Math. 260 (2019)
Jia Wei, Zhifu You, Hong-Jian Lai
Spectral analogues of Erdős' theorem on Hamilton-connected graphs. Appl. Math. Comput. 340 (2019)
Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou
} -Free Graphs. Graphs Comb. 35 (1) (2019)
Hong-Jian Lai, Xuezheng Lv, Murong Xu
On r-hued colorings of graphs without short induced paths. Discret. Math. 342 (7) (2019)
Ping Li, Lan Wang, Yang Wu, Hong-Jian Lai
Characterizations of matroids with an element lying in a restricted number of circuits. J. Comb. Optim. 38 (3) (2019)
Muhuo Liu, Hong-Jian Lai, Kinkar Chandra Das
Spectral results on Hamiltonian problem. Discret. Math. 342 (6) (2019)
Ruifang Liu, Hong-Jian Lai, Yingzhi Tian, Yang Wu
Vertex-connectivity and eigenvalues of graphs with fixed girth. Appl. Math. Comput. (2019)
Yingzhi Tian, Hong-Jian Lai, Liqiong Xu, Jixiang Meng
Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs. Discret. Math. 342 (2) (2019)
Miaomiao Han, Hong-Jian Lai, Jianping Liu
Modulo 5-orientations and degree sequences. Discret. Appl. Math. 260 (2019)
Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou
On s-hamiltonian line graphs of claw-free graphs. Discret. Math. 342 (11) (2019)
Yingzhi Tian, Hong-Jian Lai, Jixiang Meng
On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs. Graphs Comb. 35 (5) (2019)
Hong-Jian Lai, Jiaao Li
Packing spanning trees in highly essentially connected graphs. Discret. Math. 342 (1) (2019)
Jiangxu Kong, Suohai Fan, Hong-Jian Lai, Murong Xu
Linear list r-hued colorings of graphs with bounded maximum subgraph average degrees. Ars Comb. 140 (2018)
Miaomiao Han, Hong-Jian Lai, Jiaao Li
Nowhere-zero 3-flow and -connectedness in graphs with four edge-disjoint spanning trees. J. Graph Theory 88 (4) (2018)
Jian Cheng, Hong-Jian Lai, Kate J. Lorenzen, Rong Luo, Joshua C. Thompson, Cun-Quan Zhang
r-hued coloring of sparse graphs. Discret. Appl. Math. 237 (2018)
Huimin Song, Hong-Jian Lai, Jianliang Wu
List r-hued chromatic number of graphs with bounded maximum average degrees. Discret. Math. 341 (5) (2018)
Ping Li, Keke Wang, Mingquan Zhan, Hong-Jian Lai
Strongly Spanning Trailable Graphs with Short Longest Paths. Ars Comb. 137 (2018)
Xiaofeng Gu, Hong-Jian Lai
A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs. Discret. Math. 341 (2) (2018)
Mingzu Zhang, Lianzhu Zhang, Xing Feng, Hong-Jian Lai
(N)) Algorithm for Reliability Evaluation of h-Extra Edge-Connectivity of Folded Hypercubes. IEEE Trans. Reliab. 67 (1) (2018)
Mansour J. Algefari, Hong-Jian Lai, Jinquan Xu
Locally dense supereulerian digraphs. Discret. Appl. Math. 238 (2018)
Miaomiao Han, Hong-Jian Lai, Jiaao Li
Modulo orientations with bounded independence number. Discret. Appl. Math. 247 (2018)
Tingzeng Wu, Hong-Jian Lai
Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral. Graphs Comb. 34 (6) (2018)
Jianping Liu, Aimei Yu, Keke Wang, Hong-Jian Lai
Degree sum and hamiltonian-connected line graphs. Discret. Math. 341 (5) (2018)
Jiaao Li, Xinmin Hou, Miaomiao Han, Hong-Jian Lai
Mod (2p+1)-Orientation on Bipartite Graphs and Complementary Graphs. SIAM J. Discret. Math. 32 (1) (2018)
Xindong Zhang, Juan Liu, Lan Wang, Hong-Jian Lai
Supereulerian bipartite digraphs. J. Graph Theory 89 (1) (2018)
Janet Anderson, Hong-Jian Lai, Xiaomin Li, Xiaoxia Lin, Murong Xu
Minimax properties of some density measures in graphs and digraphs. Int. J. Comput. Math. Comput. Syst. Theory 3 (1) (2018)
Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Liqiong Xu
Connectivity keeping stars or double-stars in 2-connected graphs. Discret. Math. 341 (4) (2018)
Huimin Song, Hong-Jian Lai
Upper bounds of r-hued colorings of planar graphs. Discret. Appl. Math. 243 (2018)
Huimin Song, Lianying Miao, Zhengke Miao, Hong-Jian Lai
Sensitivity of r-hued colouring of graphs. Int. J. Comput. Math. Comput. Syst. Theory 3 (4) (2018)
Tingzeng Wu, Hong-Jian Lai
On the permanental sum of graphs. Appl. Math. Comput. 331 (2018)
Xiaomin Li, Lan Lei, Hong-Jian Lai
The connectivity of generalized graph products. Inf. Process. Lett. 136 (2018)
Yanmei Hong, Qinghai Liu, Hong-Jian Lai
Characterization of Digraphic Sequences with Strongly Connected Realizations. J. Graph Theory 84 (2) (2017)
Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong
Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs. J. Comb. Theory, Ser. B 122 (2017)
Wei Xiong, Jinquan Xu, Zhengke Miao, Yang Wu, Hong-Jian Lai
Supereulerian width of dense graphs. Discret. Math. 340 (12) (2017)
Janet Anderson, Hong-Jian Lai, Xiaoxia Lin, Murong Xu
-Maximal Strength Digraphs. J. Graph Theory 84 (1) (2017)
Hao Li, Hong-Jian Lai
-free graphs. Discret. Appl. Math. 222 (2017)
Zhen-Kun Zhang, Hong-Jian Lai
Characterizations of k-cutwidth critical trees. J. Comb. Optim. 34 (1) (2017)
Jiaao Li, Hong-Jian Lai, Rong Luo
Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees. SIAM J. Discret. Math. 31 (3) (2017)
Zhi-Hong Chen, Hong-Jian Lai, Meng Zhang
Spanning trails with variations of Chvátal-Erdős conditions. Discret. Math. 340 (2) (2017)
Hao Li, Hong-Jian Lai, Yang Wu, Shuzhen Zhu
Panconnected index of graphs. Discret. Math. 340 (5) (2017)
Yanting Liang, Hong-Jian Lai, Rong Luo, Rui Xu
Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations. Graphs Comb. 32 (3) (2016)
Mansour J. Algefari, Hong-Jian Lai
Supereulerian Digraphs with Large Arc-Strong Connectivity. J. Graph Theory 81 (4) (2016)
Shuangshuang Li, Zhao Zhang, Hong-Jian Lai
Algorithm for constraint partial inverse matroid problem with weight increase forbidden. Theor. Comput. Sci. 640 (2016)
Xiaoxia Lin, Suohai Fan, Hong-Jian Lai, Murong Xu
On the lower bound of k-maximal digraphs. Discret. Math. 339 (10) (2016)

Hong-Jian Lai.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hong-Jian Lai