default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHong-Jian Lai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j256]Yaxin Shi, Fengxia Liu
, Hong-Jian Lai:
On r-hued coloring of connected P5-free tripartite graphs. Appl. Math. Comput. 479: 128861 (2024)- [j255]Meng Tang, Fengxia Liu, Hong-Jian Lai:
The list r-hued coloring of Km,n. Discret. Appl. Math. 348: 159-164 (2024) - [j254]Jiani Zou, Miaomiao Han, Hong-Jian Lai:
Square coloring of planar graphs with maximum degree at most five. Discret. Appl. Math. 353: 4-11 (2024) - [j253]Wei Xiong, Xing Chen, Yang Wu, Zhifu You, Hong-Jian Lai:
Spanning connectivity of K1,r-free split graphs. Discret. Appl. Math. 358: 176-183 (2024) - [j252]Yue Yan, Lan Lei, Yang Wu, Hong-Jian Lai:
Squares of graphs are optimally (s,t)-supereulerian. Discret. Appl. Math. 359: 331-342 (2024) - [j251]Juan Liu, Hong Yang, Xindong Zhang, Hong-Jian Lai:
Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs. Discret. Math. 347(4): 113867 (2024) - [j250]Xiaoling Ma, Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou:
On s-hamiltonian-connected line graphs. Discuss. Math. Graph Theory 44(1): 297 (2024) - [j249]Lan Lei, Xiaomin Li, Sulin Song, Yikang Xie, Hong-Jian Lai:
Spanning trails avoiding and containing given edges. Discuss. Math. Graph Theory 44(4): 1429-1447 (2024) - 2023
- [j248]Lingmei Liang, Fengxia Liu, Hong-Jian Lai:
On list r-hued coloring of outer-1-planar graphs. Appl. Math. Comput. 440: 127658 (2023) - [j247]Hui Zhang, Rong-Xia Hao, Hong-Jian Lai, Jaeun Lee:
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs. Discret. Appl. Math. 338: 320-328 (2023) - [j246]Xia Liu, Hong-Jian Lai:
Hamilton-connected claw-free graphs with Ore-degree conditions. Discret. Appl. Math. 341: 130-139 (2023) - [j245]Wei Xiong, Fengxia Liu, Yang Wu, Mingquan Zhan, Hong-Jian Lai:
Complete family reduction and spanning connectivity in line graphs. Discret. Math. 346(1): 113210 (2023) - [j244]Xia Liu, Sulin Song, Mingquan Zhan, Hong-Jian Lai:
On hamiltonian properties of K1,r-free split graphs. Discret. Math. 346(7): 113402 (2023) - [j243]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): 179-194 (2023) - [j242]Jinyu Zou, Zhao Wang, Hong-Jian Lai, Yaping Mao:
Gallai-Ramsey Numbers Involving a Rainbow 4-Path. Graphs Comb. 39(3): 54 (2023) - [j241]Hong-Yu Chen, Hong-Jian Lai:
On the Linear Arboricity of Graphs with Treewidth at Most Four. Graphs Comb. 39(4): 70 (2023) - [j240]Bofeng Huo, Qingsong Du, Ping Li, Yang Wu, Jun Yin, Hong-Jian Lai:
Supereulerian regular matroids without small cocircuits. J. Graph Theory 102(1): 107-127 (2023) - 2022
- [j239]Juan Liu, Shupeng Li, Xindong Zhang, Hong-Jian Lai:
Hamiltonian index of directed multigraph. Appl. Math. Comput. 425: 127074 (2022) - [j238]Lixin Dong, Haixing Zhao, Hong-Jian Lai:
Local Optimality of Mixed Reliability for Several Classes of Networks with Fixed Sizes. Axioms 11(3): 91 (2022) - [j237]Jianbing Liu, Miaomiao Han, Hong-Jian Lai:
Weighted Modulo Orientations of Graphs and Signed Graphs. Electron. J. Comb. 29(4) (2022) - [j236]Wenjuan Wei, Fengxia Liu, Wei Xiong, Hong-Jian Lai:
On r-hued list coloring of K4(7)-minor free graphs. Discret. Appl. Math. 309: 301-309 (2022) - [j235]Lan Lei, Xiaoming Li, Yang Wu, Taoye Zhang, Hong-Jian Lai:
Strengthened Ore conditions for (s, t)-supereulerian graphs. Discret. Appl. Math. 320: 68-80 (2022) - [j234]Ye Chen, Suohai Fan, Hong-Jian Lai, Murong Xu:
Graph r-hued colorings - A survey. Discret. Appl. Math. 321: 24-48 (2022) - [j233]Xiaoxia Lin, Keke Wang, Meng Zhang, Hong-Jian Lai:
Bounding ℓ-edge-connectivity in edge-connectivity. Discret. Appl. Math. 321: 350-356 (2022) - [j232]Lan Lei, Wei Xiong, Yikang Xie, Mingquan Zhan, Hong-Jian Lai:
On the extended Clark-Wormold Hamiltonian-like index problem. Discret. Math. 345(4): 112745 (2022) - [j231]Ruifang Liu, Hong-Jian Lai, Rao Li:
Hamiltonian s-properties and eigenvalues of k-connected graphs. Discret. Math. 345(4): 112774 (2022) - [j230]Xia Liu, Sulin Song, Hong-Jian Lai:
Hamiltonian line graphs with local degree conditions. Discret. Math. 345(6): 112825 (2022) - [j229]Jianbing Liu, Miaomiao Han, Hong-Jian Lai:
Modulo orientations and matchings in graphs. Discret. Math. 345(7): 112877 (2022) - [j228]Aimei Yu, Ping Li, Yang Wu, Hong-Jian Lai:
On the s-hamiltonianicity of an hourglass-free line graph. Discret. Math. 345(8): 112897 (2022) - [j227]Sulin Song, Lan Lei, Yehong Shao, Hong-Jian Lai:
Asymptotically sharpening the $s$-Hamiltonian index bound. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j226]Liqiong Xu, Hong-Jian Lai, Yingzhi Tian, Murong Xu:
The Extremal Sizes of Arc-Maximal (k, l)-Digraphs. Graphs Comb. 38(3): 72 (2022) - [j225]Xiaofeng Gu, Hong-Jian Lai, Sulin Song:
On hamiltonian line graphs of hypergraphs. J. Graph Theory 100(3): 489-503 (2022) - [j224]Juan Liu, Hong Yang, Hong-Jian Lai, Xindong Zhang:
Trail-Connected Digraphs with Given Local Structures. J. Interconnect. Networks 22(1): 2142016:1-2142016:11 (2022) - 2021
- [j223]Ruichao Niu, Min Xu, Hong-Jian Lai:
Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube. Appl. Math. Comput. 400: 126090 (2021) - [j222]Wei Xiong, Sulin Song, Yikang Xie, Mingquan Zhan, Hong-Jian Lai:
Polynomially determining spanning connectivity of locally connected line graphs. Discret. Appl. Math. 295: 102-111 (2021) - [j221]Jiang Zhou, Changjiang Bu, Hong-Jian Lai:
Edge-disjoint spanning trees and forests of graphs. Discret. Appl. Math. 299: 74-81 (2021) - [j220]Juan Liu, Omaema Lasfar, Jia Wei, Xindong Zhang, Hong-Jian Lai:
Matching and spanning trails in digraphs. Discret. Appl. Math. 304: 417-431 (2021) - [j219]Xiaoling Ma, Yang Wu, Mingquan Zhan, Hong-Jian Lai:
On s-hamiltonicity of net-free line graphs. Discret. Math. 344(1): 112173 (2021) - [j218]Xiaoling Ma, Lan Lei, Hong-Jian Lai, Mingquan Zhan:
On the line graph of a graph with diameter 2. Discret. Math. 344(1): 112177 (2021) - [j217]Lan Lei, Wei Xiong, Yikang Xie, Mingquan Zhan, Hong-Jian Lai:
On (s, t)-supereulerian graphs with linear degree bounds. Discret. Math. 344(3): 112239 (2021) - [j216]Juan Liu, Hong Yang, Hong-Jian Lai, Xindong Zhang:
Symmetric core and spanning trails in directed networks. Discret. Math. 344(11): 112584 (2021) - [j215]Wei Xiong, Sulin Song, Hong-Jian Lai:
Polynomially determine if a graph is (s, 3)-supereulerian. Discret. Math. 344(12): 112601 (2021) - [j214]Mansour J. Algefari, Hong-Jian Lai:
Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree. Graphs Comb. 37(1): 55-64 (2021) - [j213]Xia Liu, Liming Xiong, Hong-Jian Lai:
Strongly Spanning Trailable Graphs with Small Circumference and Hamilton-Connected Claw-Free Graphs. Graphs Comb. 37(1): 65-85 (2021) - [j212]Hong-Jian Lai, Lucian Mazza:
Group Colorings and DP-Colorings of Multigraphs Using Edge-Disjoint Decompositions. Graphs Comb. 37(6): 2227-2243 (2021) - [j211]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): 285-308 (2021) - [j210]Hong-Jian Lai, Lucian Mazza:
A Note on Group Colorings and Group Structure. SIAM J. Discret. Math. 35(4): 2535-2543 (2021) - 2020
- [j209]Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou:
Pancyclicity of 4-connected claw-free net-free graphs. Australas. J Comb. 76: 366-386 (2020) - [j208]Hong-Jian Lai, Keke Wang, Xiaowei Xie, Mingquan Zhan:
Catlin's reduced graphs with small orders. AKCE Int. J. Graphs Comb. 17(2): 679-690 (2020) - [j207]Ye Chen, Suohai Fan, Hong-Jian Lai, Huimin Song, Murong Xu:
Decomposition and r-hued Coloring of K4(7)-minor free graphs. Appl. Math. Comput. 384: 125206 (2020) - [j206]Liqiong Xu, Hong-Jian Lai, Yingzhi Tian:
On the extremal sizes of maximal graphs without (k+1)-connected subgraphs. Discret. Appl. Math. 285: 397-406 (2020) - [j205]Miaomiao Han, Hong-Jian Lai, Jiaao Li, Yezhou Wu:
Contractible graphs for flow index less than three. Discret. Math. 343(11): 112073 (2020) - [j204]Jian-Bing Liu, Ping Li, Jiaao Li, Hong-Jian Lai:
On weighted modulo orientation of graphs. Eur. J. Comb. 89: 103163 (2020) - [j203]Muhuo Liu, Yang Wu, Hong-Jian Lai:
Unified Spectral Hamiltonian Results of Balanced Bipartite Graphs and Complementary Graphs. Graphs Comb. 36(5): 1363-1390 (2020) - [j202]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): 1-14 (2020) - [j201]Liqiong Xu, Yingzhi Tian, Hong-Jian Lai:
On the sizes of bi-k-maximal graphs. J. Comb. Optim. 39(3): 859-873 (2020)
2010 – 2019
- 2019
- [j200]Jia Wei, Zhifu You, Hong-Jian Lai:
Spectral analogues of Erdős' theorem on Hamilton-connected graphs. Appl. Math. Comput. 340: 242-250 (2019) - [j199]Ruifang Liu, Hong-Jian Lai, Yingzhi Tian, Yang Wu:
Vertex-connectivity and eigenvalues of graphs with fixed girth. Appl. Math. Comput. 344-345: 141-149 (2019) - [j198]Miaomiao Han, Hong-Jian Lai, Jianping Liu:
Modulo 5-orientations and degree sequences. Discret. Appl. Math. 260: 155-163 (2019) - [j197]Ran Gu, Hong-Jian Lai, Yanting Liang, Zhengke Miao, Meng Zhang:
Collapsible subgraphs of a 4-edge-connected graph. Discret. Appl. Math. 260: 272-277 (2019) - [j196]Hong-Jian Lai, Jiaao Li:
Packing spanning trees in highly essentially connected graphs. Discret. Math. 342(1): 1-9 (2019) - [j195]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): 344-351 (2019) - [j194]Muhuo Liu, Hong-Jian Lai, Kinkar Chandra Das:
Spectral results on Hamiltonian problem. Discret. Math. 342(6): 1718-1730 (2019) - [j193]Hong-Jian Lai, Xuezheng Lv, Murong Xu:
On r-hued colorings of graphs without short induced paths. Discret. Math. 342(7): 1904-1911 (2019) - [j192]Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou:
On s-hamiltonian line graphs of claw-free graphs. Discret. Math. 342(11): 3006-3016 (2019) - [j191]Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou:
Pancyclicity of 4-Connected { K1, 3, Z8} -Free Graphs. Graphs Comb. 35(1): 67-89 (2019) - [j190]Yingzhi Tian, Hong-Jian Lai, Jixiang Meng:
On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs. Graphs Comb. 35(5): 1001-1010 (2019) - [j189]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): 887-910 (2019) - 2018
- [j188]Tingzeng Wu, Hong-Jian Lai:
On the permanental sum of graphs. Appl. Math. Comput. 331: 334-340 (2018) - [j187]Ping Li, Keke Wang, Mingquan Zhan, Hong-Jian Lai:
Strongly Spanning Trailable Graphs with Short Longest Paths. Ars Comb. 137: 3-39 (2018) - [j186]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: 149-172 (2018) - [j185]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: 75-81 (2018) - [j184]Mansour J. Algefari, Hong-Jian Lai, Jinquan Xu:
Locally dense supereulerian digraphs. Discret. Appl. Math. 238: 24-31 (2018) - [j183]Huimin Song, Hong-Jian Lai:
Upper bounds of r-hued colorings of planar graphs. Discret. Appl. Math. 243: 262-269 (2018) - [j182]Miaomiao Han, Hong-Jian Lai, Jiaao Li:
Modulo orientations with bounded independence number. Discret. Appl. Math. 247: 14-22 (2018) - [j181]Xiaofeng Gu, Hong-Jian Lai:
A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs. Discret. Math. 341(2): 400-404 (2018) - [j180]Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Liqiong Xu:
Connectivity keeping stars or double-stars in 2-connected graphs. Discret. Math. 341(4): 1120-1124 (2018) - [j179]Huimin Song, Hong-Jian Lai, Jianliang Wu:
List r-hued chromatic number of graphs with bounded maximum average degrees. Discret. Math. 341(5): 1244-1252 (2018) - [j178]Jianping Liu, Aimei Yu, Keke Wang, Hong-Jian Lai:
Degree sum and hamiltonian-connected line graphs. Discret. Math. 341(5): 1363-1379 (2018) - [j177]Tingzeng Wu, Hong-Jian Lai:
Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral. Graphs Comb. 34(6): 1713-1721 (2018) - [j176]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): 1-12 (2018) - [j175]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): 262-273 (2018) - [j174]Xiaomin Li, Lan Lei, Hong-Jian Lai:
The connectivity of generalized graph products. Inf. Process. Lett. 136: 37-40 (2018) - [j173]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): 577-591 (2018) - [j172]Xindong Zhang, Juan Liu, Lan Wang, Hong-Jian Lai:
Supereulerian bipartite digraphs. J. Graph Theory 89(1): 64-75 (2018) - [j171]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): 29-43 (2018) - [j170]Mingzu Zhang, Lianzhu Zhang, Xing Feng, Hong-Jian Lai:
An O(log2(N)) Algorithm for Reliability Evaluation of h-Extra Edge-Connectivity of Folded Hypercubes. IEEE Trans. Reliab. 67(1): 297-307 (2018) - 2017
- [j169]Hao Li, Hong-Jian Lai:
3-dynamic coloring and list 3-dynamic coloring of K1, 3-free graphs. Discret. Appl. Math. 222: 166-171 (2017) - [j168]Zhi-Hong Chen, Hong-Jian Lai, Meng Zhang:
Spanning trails with variations of Chvátal-Erdős conditions. Discret. Math. 340(2): 243-251 (2017) - [j167]Hao Li, Hong-Jian Lai, Yang Wu, Shuzhen Zhu:
Panconnected index of graphs. Discret. Math. 340(5): 1092-1097 (2017) - [j166]Wei Xiong, Jinquan Xu, Zhengke Miao, Yang Wu, Hong-Jian Lai:
Supereulerian width of dense graphs. Discret. Math. 340(12): 2995-3001 (2017) - [j165]Zhen-Kun Zhang, Hong-Jian Lai:
Characterizations of k-cutwidth critical trees. J. Comb. Optim. 34(1): 233-244 (2017) - [j164]Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong:
Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs. J. Comb. Theory B 122: 167-186 (2017) - [j163]Janet Anderson, Hong-Jian Lai, Xiaoxia Lin, Murong Xu:
On k-Maximal Strength Digraphs. J. Graph Theory 84(1): 17-25 (2017) - [j162]Yanmei Hong, Qinghai Liu, Hong-Jian Lai:
Characterization of Digraphic Sequences with Strongly Connected Realizations. J. Graph Theory 84(2): 191-201 (2017) - [j161]Jiaao Li, Hong-Jian Lai, Rong Luo:
Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees. SIAM J. Discret. Math. 31(3): 1909-1922 (2017) - 2016
- [j160]H. Chuang, Hong-Jian Lai, G. R. Omidi, Niloufar Zakeri:
On group choosability of graphs, I. Ars Comb. 126: 195-209 (2016) - [j159]Huimin Song, Hong-Jian Lai, Jian-Liang Wu:
On r-hued coloring of planar graphs with girth at least 6. Discret. Appl. Math. 198: 251-263 (2016) - [j158]Ping Li, Hao Li, Ye Chen, Herbert Fleischner, Hong-Jian Lai:
Supereulerian graphs with width s and s-collapsible graphs. Discret. Appl. Math. 200: 79-94 (2016) - [j157]Xiaoling Ma, Hong-Jian Lai, Wei Xiong, Baoyingdureng Wu, Xinhui An:
Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs. Discret. Appl. Math. 202: 111-130 (2016) - [j156]Yanmei Hong, Xiaofeng Gu, Hong-Jian Lai, Qinghai Liu:
Fractional spanning tree packing, forest covering and eigenvalues. Discret. Appl. Math. 213: 219-223 (2016) - [j155]Aimei Yu, Jianping Liu, Miaomiao Han, Hong-Jian Lai:
On dense strongly Z2s-1-connected graphs. Discret. Math. 339(2): 850-856 (2016) - [j154]Lianying Miao, Hong-Jian Lai, Yan-Fang Guo, Zhengke Miao:
Element deletion changes in dynamic coloring of graphs. Discret. Math. 339(5): 1600-1604 (2016) - [j153]Yanmei Hong, Qinghai Liu, Hong-Jian Lai:
Ore-type degree condition of supereulerian digraphs. Discret. Math. 339(8): 2042-2050 (2016) - [j152]Xiaoxia Lin, Suohai Fan, Hong-Jian Lai, Murong Xu:
On the lower bound of k-maximal digraphs. Discret. Math. 339(10): 2500-2510 (2016) - [j151]Yanting Liang, Hong-Jian Lai, Rong Luo, Rui Xu:
Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations. Graphs Comb. 32(3): 1065-1075 (2016) - [j150]Mansour J. Algefari, Khalid A. Alsatami, Hong-Jian Lai, Juan Liu:
Supereulerian digraphs with given local structures. Inf. Process. Lett. 116(5): 321-326 (2016) - [j149]Zhao Zhang, Shuangshuang Li, Hong-Jian Lai, Ding-Zhu Du:
Algorithms for the partial inverse matroid problem in which weights can only be increased. J. Glob. Optim. 65(4): 801-811 (2016) - [j148]Xiaofeng Gu, Hong-Jian Lai, Ping Li, Senmei Yao:
Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs. J. Graph Theory 81(1): 16-29 (2016) - [j147]Xinmin Hou, Hong-Jian Lai, Cun-Quan Zhang:
On Perfect Matching Coverings and Even Subgraph Coverings. J. Graph Theory 81(1): 83-91 (2016) - [j146]Mansour J. Algefari, Hong-Jian Lai:
Supereulerian Digraphs with Large Arc-Strong Connectivity. J. Graph Theory 81(4): 393-402 (2016) - [j145]Shuangshuang Li, Zhao Zhang, Hong-Jian Lai:
Algorithm for constraint partial inverse matroid problem with weight increase forbidden. Theor. Comput. Sci. 640: 119-124 (2016) - 2015
- [j144]Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
K-5-factor in a Graph. Ars Comb. 122: 97-124 (2015) - [j143]Fengxia Liu, Zhao Zhang, Hong-Jian Lai, Meng Zhang:
Degree sequence realizations with given packing and covering of spanning trees. Discret. Appl. Math. 185: 113-118 (2015) - [j142]Zhi-Hong Chen, Miaomiao Han, Hong-Jian Lai, Mingquan Zhan:
Graphs with a 3-Cycle-2-Cover. Graphs Comb. 31(6): 2103-2111 (2015) - 2014
- [j141]Hong-Jian Lai, Bolian Liu, Ju Zhou:
Bounds of eigenvalues of a nontrivial bipartite graph. Ars Comb. 113: 341-351 (2014) - [j140]Jinquan Xu, Zhi-Hong Chen, Hong-Jian Lai, Meng Zhang:
Spanning trails in essentially 4-edge-connected graphs. Discret. Appl. Math. 162: 306-313 (2014) - [j139]Hong-Jian Lai, Yanting Liang, Juan Liu, Jixiang Meng, Zhengke Miao, Yehong Shao, Zhao Zhang:
On strongly Z2s-1-connected graphs. Discret. Appl. Math. 174: 73-80 (2014) - [j138]Zhaohong Niu, Liang Sun, Liming Xiong, Hong-Jian Lai, Huiya Yan:
On extremal k-supereulerian graphs. Discret. Math. 314: 50-60 (2014) - [j137]Huimin Song, Suohai Fan, Ye Chen, Lei Sun, Hong-Jian Lai:
On r-hued coloring of K4-minor free graphs. Discret. Math. 315-316: 47-52 (2014) - [j136]Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Zhao Zhang:
On the existence of super edge-connected graphs with prescribed degrees. Discret. Math. 328: 36-41 (2014) - [j135]Yanmei Hong, Hong-Jian Lai, Qinghai Liu:
Supereulerian digraphs. Discret. Math. 330: 87-95 (2014) - [j134]Fan Yang, Xiangwen Li, Hong-Jian Lai:
Realizing degree sequences as Z3-connected graphs. Discret. Math. 333: 110-119 (2014) - [j133]Weihua Yang, Hong-Jian Lai, Hao Li, Xiaofeng Guo:
Collapsible Graphs and Hamiltonicity of Line Graphs. Graphs Comb. 30(2): 501-510 (2014) - [j132]H. Chuang, Hong-Jian Lai, G. R. Omidi, K. Wang, Niloufar Zakeri:
On Group Choosability of Graphs, II. Graphs Comb. 30(3): 549-563 (2014) - [j131]Xiaofeng Gu, Hong-Jian Lai, Ping Li, Senmei Yao:
Characterizations of Strength Extremal Graphs. Graphs Comb. 30(6): 1453-1461 (2014) - [j130]Jinquan Xu, Ping Li, Zhengke Miao, Keke Wang, Hong-Jian Lai:
Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs. Int. J. Comput. Math. 91(8): 1662-1672 (2014) - [j129]Wei Xiong, Zhao Zhang, Hong-Jian Lai:
Spanning 3-connected index of graphs. J. Comb. Optim. 27(1): 199-208 (2014) - [j128]Ping Li, Hong-Jian Lai:
On Mod (2s+1)-Orientations of Graphs. SIAM J. Discret. Math. 28(4): 1820-1827 (2014) - 2013
- [j127]Hao Li, Hong-Jian Lai:
Group colorability of multigraphs. Discret. Math. 313(1): 101-104 (2013) - [j126]Yanmei Hong, Hong-Jian Lai:
Non-separating subgraphs. Discret. Math. 313(4): 391-396 (2013) - [j125]Wei Xiong, Hong-Jian Lai, Xiaoling Ma, Keke Wang, Meng Zhang:
Hamilton cycles in 3-connected claw-free and net-free graphs. Discret. Math. 313(6): 784-795 (2013) - [j124]Xiaofeng Gu, Hong-Jian Lai:
Realizing degree sequences with k-edge-connected uniform hypergraphs. Discret. Math. 313(11): 1394-1400 (2013) - [j123]Hong-Jian Lai, G. R. Omidi, Ghaffar Raeisi:
On Group Choosability of Total Graphs. Graphs Comb. 29(3): 585-597 (2013) - [j122]Ye Chen, Zhi-Hong Chen, Hong-Jian Lai, Ping Li, Erling Wei:
On Spanning Disjoint Paths in Line Graphs. Graphs Comb. 29(6): 1721-1731 (2013) - [j121]Hong-Jian Lai, Yehong Shao:
On s-Hamiltonian Line Graphs. J. Graph Theory 74(3): 344-358 (2013) - [j120]Ádám M. Halász, Hong-Jian Lai, Meghan McCabe Pryor, Krishnan Radhakrishnan, Jeremy S. Edwards:
Analytical Solution of Steady-State Equations for Chemical Reaction Networks with Bilinear Rate Laws. IEEE ACM Trans. Comput. Biol. Bioinform. 10(4): 957-969 (2013) - 2012
- [j119]Xiaofeng Gu, Hong-Jian Lai, Yanting Liang:
Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees. Appl. Math. Lett. 25(10): 1426-1429 (2012) - [j118]Weihua Yang, Liming Xiong, Hong-Jian Lai, Xiaofeng Guo:
Hamiltonicity of 3-connected line graphs. Appl. Math. Lett. 25(11): 1835-1838 (2012) - [j117]Kewen Zhao, Lili Zhang, Hong-Jian Lai, Yehong Shao:
Hamiltonian graphs involving neighborhood conditions. Ars Comb. 105: 161-170 (2012) - [j116]Xiaomin Li, Dengxin Li, Hong-Jian Lai:
Spanning Eulerian Subgraphs in Generalized Prisms. Ars Comb. 106: 305-312 (2012) - [j115]Ye Chen, Suohai Fan, Hong-Jian Lai, Huimin Song, Lei Sun:
On dynamic coloring for planar graphs and graphs of higher genus. Discret. Appl. Math. 160(7-8): 1064-1071 (2012) - [j114]Weihua Yang, Hong-Jian Lai, Hao Li, Xiaofeng Guo:
Collapsible graphs and Hamiltonian connectedness of line graphs. Discret. Appl. Math. 160(12): 1837-1844 (2012) - [j113]Ping Li, Hong-Jian Lai, Yanting Liang:
Characterization of removable elements with respect to having k disjoint bases in a matroid. Discret. Appl. Math. 160(16-17): 2445-2451 (2012) - [j112]Zhaohong Niu, Hong-Jian Lai, Liming Xiong:
Spanning subgraph with Eulerian components. Discret. Math. 312(5): 1013-1018 (2012) - [j111]Xiangwen Li, Hong-Jian Lai, Yehong Shao:
Degree condition and Z3-connectivity. Discret. Math. 312(10): 1658-1669 (2012) - [j110]Ye Chen, Suohai Fan, Hong-Jian Lai:
On 3-connected hamiltonian line graphs. Discret. Math. 312(11): 1877-1882 (2012) - [j109]Deying Li, Suohai Fan, Hong-Jian Lai, Senmei Yao:
A dual version of the Brooks group coloring theorem. Discret. Math. 312(15): 2294-2303 (2012) - [j108]Xinmin Hou, Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou:
Z3-connectivity of 4-edge-connected 2-triangular graphs. Eur. J. Comb. 33(2): 182-188 (2012) - [j107]Ping Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Spanning cycles in regular matroids without small cocircuits. Eur. J. Comb. 33(8): 1765-1776 (2012) - [j106]Jinquan Xu, Ping Li, Hong-Jian Lai:
The Connectivity and Diameter of Second Order Circuit Graphs of Matroids. Graphs Comb. 28(5): 737-742 (2012) - [j105]Xinmin Hou, Hong-Jian Lai, Ping Li, Cun-Quan Zhang:
Group connectivity of complementary graphs. J. Graph Theory 69(4): 464-470 (2012) - 2011
- [j104]Hong-Jian Lai, Huiya Yan:
Supereulerian graphs and matchings. Appl. Math. Lett. 24(11): 1867-1869 (2011) - [j103]Hong-Jian Lai, Yanting Liang:
Supereulerian graphs in the graph family C2(6, k). Discret. Appl. Math. 159(6): 467-477 (2011) - [j102]Hong-Jian Lai, Yanting Liang, Ping Li, Jinquan Xu:
Degree sequences and graphs with disjoint spanning trees. Discret. Appl. Math. 159(14): 1447-1452 (2011) - [j101]Hong-Jian Lai, Hao Li, Ping Li, Yanting Liang, Senmei Yao:
Group connectivity in line graphs. Discret. Math. 311(20): 2295-2307 (2011) - [j100]Erling Wei, Ye Chen, Ping Li, Hong-Jian Lai:
Every N2-Locally Connected claw-Free Graph with Minimum Degree at Least 7 is Z3-Connected. Discret. Math. Algorithms Appl. 3(2): 193-202 (2011) - [j99]Hong-Jian Lai, Manoel Lemos, Talmage James Reid, Yehong Shao, Haidong Wu:
Obstructions to a binary matroid being graphic. Eur. J. Comb. 32(6): 853-860 (2011) - [j98]Hong-Jian Lai, Hao Li, Yehong Shao, Mingquan Zhan:
On 3-Edge-Connected Supereulerian Graphs. Graphs Comb. 27(2): 207-214 (2011) - [j97]Hong-Jian Lai, Hao Li, Ping Li, Yanting Liang, Senmei Yao:
Mod (2p+1)-orientations in line graphs. Inf. Process. Lett. 111(23-24): 1085-1088 (2011) - [j96]Xiaofeng Gu, Hong-Jian Lai, Senmei Yao:
Characterization of minimally (2, l)-connected graphs. Inf. Process. Lett. 111(23-24): 1124-1129 (2011) - 2010
- [j95]Hong-Jian Lai, Mingchu Li, Yehong Shao, Liming Xiong:
Spanning eulerian subgraphs in N2-locally connected claw-free graphs. Ars Comb. 94 (2010) - [j94]Arthur M. Hobbs, Lavanya Kannan, Hong-Jian Lai, Hongyuan Lai, Guoqing Weng:
Balanced and 1-balanced graph constructions. Discret. Appl. Math. 158(14): 1511-1523 (2010) - [j93]Lan Lei, Xiao-Min Li, Bin Wang, Hong-Jian Lai:
On (s, t)-supereulerian graphs in locally highly connected graphs. Discret. Math. 310(4): 929-934 (2010) - [j92]Xiangjuan Yao, Xiangwen Li, Hong-Jian Lai:
Degree conditions for group connectivity. Discret. Math. 310(5): 1050-1058 (2010) - [j91]Longsheng Han, Hong-Jian Lai, Liming Xiong, Huiya Yan:
The Chvátal-Erdös condition for supereulerian graphs and the Hamiltonian index. Discret. Math. 310(15-16): 2082-2090 (2010) - [j90]Xiaomin Li, Dengxin Li, Hong-Jian Lai:
On 3-edge-connected supereulerian graphs in graph family C(l, k). Discret. Math. 310(17-18): 2455-2459 (2010) - [j89]Xiaoxia Zhang, Mingquan Zhan, Rui Xu, Yehong Shao, Xiangwen Li, Hong-Jian Lai:
Degree sum condition for Z3-connectivity in graphs. Discret. Math. 310(23): 3390-3397 (2010) - [j88]Hong-Jian Lai, Liming Xiong, Huiya Yan, Jin Yan:
Every 3-connected claw-free Z8-free graph is Hamiltonian. J. Graph Theory 64(1): 1-11 (2010) - [c3]Ádám M. Halász, Yanting Liang, M. Ani Hsieh, Hong-Jian Lai:
Emergence of Specialization in a Swarm of Robots. DARS 2010: 403-416
2000 – 2009
- 2009
- [j87]K. Subramani, Hong-Jian Lai, Xiaofeng Gu:
Random walks for selected boolean implication and equivalence problems. Acta Informatica 46(2): 155-168 (2009) - [j86]Damin Liu, Hong-Jian Lai, Zhi-Hong Chen:
Reinforcing the number of disjoint spanning trees. Ars Comb. 93 (2009) - [j85]Lavanya Kannan, Arthur M. Hobbs, Hong-Jian Lai, Hongyuan Lai:
Transforming a graph into a 1-balanced graph. Discret. Appl. Math. 157(2): 300-308 (2009) - [j84]Hong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan:
Hamiltonian connectedness in 3-connected line graphs. Discret. Appl. Math. 157(5): 982-990 (2009) - [j83]Paul A. Catlin, Hong-Jian Lai, Yehong Shao:
Edge-connectivity and edge-disjoint spanning trees. Discret. Math. 309(5): 1033-1040 (2009) - [j82]Xiaomin Li, Dengxin Li, Hong-Jian Lai:
The supereulerian graphs in the graph family C(l, k). Discret. Math. 309(9): 2937-2942 (2009) - [j81]Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan, Mingquan Zhan:
Hamilton-connected indices of graphs. Discret. Math. 309(14): 4819-4827 (2009) - [j80]Hong-Jian Lai, Lianying Miao, Yehong Shao:
Every line graph of a 4-edge-connected graph is I-connected. Eur. J. Comb. 30(2): 595-601 (2009) - [j79]Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou:
On mod (2p+1)-orientations of graphs. J. Comb. Theory B 99(2): 399-406 (2009) - [c2]Xiaofeng Gu, Kamesh Madduri, K. Subramani, Hong-Jian Lai:
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs. FAW 2009: 40-50 - 2008
- [j78]Yan Jin, Kewen Zhao, Hong-Jian Lai, Ju Zhou:
New Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs. Ars Comb. 88 (2008) - [j77]Jingjing Chen, Elaine M. Eschen, Hong-Jian Lai:
Group connectivity of certain graphs. Ars Comb. 89 (2008) - [j76]Kewen Zhao, Hong-Jian Lai, Ju Zhou:
Hamiltonian-connected graphs. Comput. Math. Appl. 55(12): 2707-2714 (2008) - [j75]Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Hamiltonian connected hourglass free line graphs. Discret. Math. 308(12): 2634-2636 (2008) - [j74]Hong-Jian Lai, Yanting Liang, Yehong Shao:
On s-hamiltonian-connected line graphs. Discret. Math. 308(18): 4293-4297 (2008) - [j73]Zhang Lili, Elaine M. Eschen, Hong-Jian Lai, Yehong Shao:
The s-Hamiltonian index. Discret. Math. 308(20): 4779-4785 (2008) - [j72]Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected. Discret. Math. 308(22): 5312-5316 (2008) - [j71]Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhang, Ju Zhou:
Degree sequence and supereulerian graphs. Discret. Math. 308(24): 6626-6631 (2008) - [j70]Hong-Jian Lai, Bolian Liu, Yan Liu, Yehong Shao:
Spanning cycles in regular matroids without M*(K5) minors. Eur. J. Comb. 29(1): 298-310 (2008) - [j69]Hong-Jian Lai, Rui Xu, Ju Zhou:
On Group Connectivity of Graphs. Graphs Comb. 24(3): 195-203 (2008) - [j68]Genghua Fan, Hong-Jian Lai, Rui Xu, Cun-Quan Zhang, Chuixiang Zhou:
Nowhere-zero 3-flows in triangularly connected graphs. J. Comb. Theory B 98(6): 1325-1336 (2008) - 2007
- [j67]Kewen Zhao, Hong-Jian Lai, Yehong Shao:
New sufficient condition for Hamiltonian graphs. Appl. Math. Lett. 20(1): 116-122 (2007) - [j66]Hong-Jian Lai, Rui Xu, Cun-Quan Zhang:
On Circular Flows Of Graphs. Comb. 27(2): 245-246 (2007) - [j65]Mingchu Li, Cheng Guo, Liming Xiong, Dengxin Li, Hong-Jian Lai:
Quadrangularly connected claw-free graphs. Discret. Math. 307(9-10): 1205-1211 (2007) - [j64]Hong-Jian Lai, Xiangjuan Yao:
Erratum to "Collapsible biclaw-free graphs": [Discrete Math 306 (2006) 2115-2117]. Discret. Math. 307(9-10): 1217 (2007) - [j63]Hong-Jian Lai, Xiangwen Li, Gexin Yu:
An inequality for the group chromatic number of a graph. Discret. Math. 307(23): 3076-3080 (2007) - [j62]Zhi-Hong Chen, Hong-Jian Lai, Wai-Chee Shiu, Deying Li:
An s -Hamiltonian Line Graph Problem. Graphs Comb. 23(3): 241-248 (2007) - [j61]Hong-Jian Lai:
Mod (2p + 1)-Orientations and $K1,2p+1-Decompositions. SIAM J. Discret. Math. 21(4): 844-850 (2007) - [c1]Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Hamiltonian Connected Line Graphs. International Conference on Computational Science (3) 2007: 377-380 - 2006
- [j60]Hong-Jian Lai, Jianliang Lin, Bruce Montgomery, Taozhi Shui, Suohai Fan:
Conditional colorings of graphs. Discret. Math. 306(16): 1997-2004 (2006) - [j59]Hong-Jian Lai, Xiangjuan Yao:
Collapsible biclaw-free graphs. Discret. Math. 306(17): 2115-2117 (2006) - [j58]Hong-Jian Lai, Xiangjuan Yao:
Group connectivity of graphs with diameter at most 2. Eur. J. Comb. 27(3): 436-443 (2006) - [j57]Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Hamiltonicity in 3-connected claw-free graphs. J. Comb. Theory B 96(4): 493-504 (2006) - [j56]Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou:
Every 3-connected, essentially 11-connected line graph is Hamiltonian. J. Comb. Theory B 96(4): 571-576 (2006) - [j55]Hong-Jian Lai, Xiangwen Li:
Group chromatic number of planar graphs of girth at least 4. J. Graph Theory 52(1): 51-72 (2006) - 2005
- [j54]Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan Zhan:
Supereulerian planar graphs. Ars Comb. 75 (2005) - [j53]Dengxin Li, Hong-Jian Lai, Mingquan Zhan:
Eulerian subgraphs and Hamilton-connected line graphs. Discret. Appl. Math. 145(3): 422-428 (2005) - [j52]Hong-Jian Lai, Xiangwen Li, Hoifung Poon, Yongbin Ou:
Spanning Trails Connecting Given Edges. Graphs Comb. 21(1): 77-88 (2005) - [j51]Hong-Jian Lai, Xiangwen Li:
On Group Chromatic Number of Graphs. Graphs Comb. 21(4): 469-474 (2005) - [j50]Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Hamiltonian N2-locally connected claw-free graphs. J. Graph Theory 48(2): 142-146 (2005) - [j49]Hong-Jian Lai, Xiangwen Li, Hoifung Poon:
Nowhere zero 4-flow in regular matroids. J. Graph Theory 49(3): 196-204 (2005) - 2004
- [j48]Xiaofan Yang, Hong-Jian Lai, David J. Evans, Graham M. Megson:
Global asymptotic stability in a rational recursive sequence. Appl. Math. Comput. 158(3): 703-716 (2004) - [j47]Xiaofan Yang, David J. Evans, Bill Chen, Graham M. Megson, Hong-Jian Lai:
On the maximal connected component of hypercube with faulty vertices. Int. J. Comput. Math. 81(5): 515-525 (2004) - [j46]Xiaofan Yang, David J. Evans, Hong-Jian Lai, Graham M. Megson:
Generalized honeycomb torus is Hamiltonian. Inf. Process. Lett. 92(1): 31-37 (2004) - 2003
- [j45]Hong-Jian Lai, Bruce Montgomery, Hoifung Poon:
Upper Bounds of Dynamic Chromatic Number. Ars Comb. 68 (2003) - [j44]Hong-Jian Lai, Xiangwen Li:
Small cycle cover of 2-connected cubic graphs. Discret. Math. 269(1-3): 295-302 (2003) - [j43]Hong-Jian Lai:
Nowhere-zero 3-flows in locally connected graphs. J. Graph Theory 42(3): 211-219 (2003) - [j42]Zhi-Hong Chen, Hong-Jian Lai, Xiangwen Li, Deying Li, Jingzhong Mao:
Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs. J. Graph Theory 42(4): 308-319 (2003) - [j41]Kamal Hennayake, Hong-Jian Lai, Deying Li, Jingzhong Mao:
Minimally (k, k)-edge-connected graphs. J. Graph Theory 44(2): 116-131 (2003) - 2002
- [j40]Hong-Jian Lai, Xiankun Zhang:
Group Colorability of Graphs. Ars Comb. 62 (2002) - [j39]Hong-Jian Lai, Hoifung Poon:
Cycle Cover Ratio of Regular Matroids. Eur. J. Comb. 23(8): 1007-1014 (2002) - [j38]Hong-Jian Lai, Xiankun Zhang:
Group Chromatic Number of Graphs without K5-Minors. Graphs Comb. 18(1): 147-154 (2002) - 2001
- [j37]Arthur M. Hobbs, Hong-Jian Lai:
Dedication. Discret. Math. 230(1-3): 1- (2001) - [j36]Arthur M. Hobbs, Hong-Jian Lai, Neil Robertson:
Paul Catlin 1948-1995. Discret. Math. 230(1-3): 3-12 (2001) - [j35]Hong-Jian Lai:
Eulerian subgraphs containing given edges. Discret. Math. 230(1-3): 63-69 (2001) - [j34]Paul A. Catlin, Arthur M. Hobbs, Hong-Jian Lai:
Graph family operations. Discret. Math. 230(1-3): 71-97 (2001) - [j33]Zhi-Hong Chen, Hong-Jian Lai, Hongyuan Lai:
Nowhere zero flows in line graphs. Discret. Math. 230(1-3): 133-141 (2001) - [j32]Hong-Jian Lai, Lubomír Soltés:
Line Graphs and Forbidden Induced Subgraphs. J. Comb. Theory B 82(1): 38-55 (2001) - [j31]Hong-Jian Lai, Cun-Quan Zhang:
Hamilton weights and Petersen minors. J. Graph Theory 38(4): 197-219 (2001) - 2000
- [j30]Hong-Jian Lai, Xiankun Zhang:
Spanning trails that join given edges in 3-edge-connected graphs. Ars Comb. 57 (2000) - [j29]Hong-Jian Lai:
Group Connectivity of 3-Edge-Connected Chordal Graphs. Graphs Comb. 16(2): 165-176 (2000)
1990 – 1999
- 1999
- [j28]Zhi-Hong Chen, Kuang Ying-Qiang, Hong-Jian Lai:
Connectivity of cycle matroids and bicircular matroids. Ars Comb. 52 (1999) - [j27]Hong-Jian Lai:
Extending a partial nowhere-zero 4-flow. J. Graph Theory 30(4): 277-288 (1999) - 1998
- [j26]Zhi-Hong Chen, Hong-Jian Lai:
Supereulerian graphs and the Petersen Graph, II. Ars Comb. 48 (1998) - [j25]Hong-Jian Lai:
Eulerian subgraphs containing given vertices and hamiltonian line graphs. Discret. Math. 178(1-3): 93-107 (1998) - 1996
- [j24]Paul A. Catlin, Zheng-Yiao Han, Hong-Jian Lai:
Graphs without spanning closed trails. Discret. Math. 160(1-3): 81-91 (1996) - [j23]Hong-Jian Lai, Hongyuan Lai, Charles Payan:
A Property on Edge-disjoint Spanning Trees. Eur. J. Comb. 17(5): 447-450 (1996) - [j22]Paul A. Catlin, Hong-Jian Lai:
Supereulerian Graphs and the Petersen Graph. J. Comb. Theory B 66(1): 123-139 (1996) - 1995
- [j21]Hong-Jian Lai, Hongyuan Lai:
The size of graphs with given edge inclusive connectivity. Ars Comb. 41 (1995) - [j20]Hong-Jian Lai:
Large Survivable Nets and the Generalized Prisms. Discret. Appl. Math. 61(2): 181-185 (1995) - [j19]Hong-Jian Lai, Hongyuan Lai:
Every Matroid Is a Submatroid of a Uniformly Dense Matroid. Discret. Appl. Math. 63(2): 151-160 (1995) - [j18]Paul A. Catlin, Hong-Jian Lai:
Vertex arboricity and maximum degree. Discret. Math. 141(1-3): 37-46 (1995) - [j17]Hong-Jian Lai, Guoqing Weng:
Strength and fractional arboricity of complementary graphs. Discret. Math. 143(1-3): 141-151 (1995) - [j16]Hong-Jian Lai:
Supereulerian graphs and excluded induced minors. Discret. Math. 146(1-3): 133-143 (1995) - [j15]Hong-Jian Lai:
The size of graphs without nowhere-zero 4-flows. J. Graph Theory 19(3): 385-395 (1995) - 1994
- [j14]Hong-Jian Lai:
Every 4-Connected Line Graph of a Planar Graph is Hamiltonian. Graphs Comb. 10(2-4): 249-253 (1994) - [j13]Hong-Jian Lai, Xingxing Yu, Cun-Quan Zhang:
Small Circuit Double Covers of Cubic Multigraphs. J. Comb. Theory B 60(2): 177-194 (1994) - [j12]Hong-Jian Lai, Cun-Quan Zhang:
Edge-maximal (k, i)-graphs. J. Graph Theory 18(3): 227-240 (1994) - 1993
- [j11]Hong-Jian Lai:
Supereulerian complementary graphs. J. Graph Theory 17(2): 263-273 (1993) - [j10]Zhi-Hong Chen, Hong-Jian Lai:
Collapsible graphs and matchings. J. Graph Theory 17(5): 597-605 (1993) - 1992
- [j9]Paul A. Catlin, Jerrold W. Grossman, Arthur M. Hobbs, Hong-Jian Lai:
Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids. Discret. Appl. Math. 40(3): 285-302 (1992) - [j8]Hong-Jian Lai, Hongyuan Lai:
Duality in graph families. Discret. Math. 110(1-3): 165-177 (1992) - [j7]Hong-Jian Lai, Cun-Quan Zhang:
Nowhere-zero 3-flows of highly connected graphs. Discret. Math. 110(1-3): 179-183 (1992) - 1991
- [j6]Hong-Jian Lai:
Graph whose edges are in small cycles. Discret. Math. 94(1): 11-22 (1991) - 1990
- [j5]Hong-Jian Lai:
Reduced graphs of diameter two. J. Graph Theory 14(1): 77-87 (1990) - [j4]Hong-Jian Lai:
The size of strength-maximal graphs. J. Graph Theory 14(2): 187-197 (1990)
1980 – 1989
- 1989
- [j3]Hong-Jian Lai:
Unique graph homomorphisms onto odd cycles, II. J. Comb. Theory B 46(3): 363-376 (1989) - 1988
- [j2]Hong-Jian Lai:
On the Hamiltonian index. Discret. Math. 69(1): 43-53 (1988) - [j1]Hong-Jian Lai:
Contractions and hamiltonian line graphs. J. Graph Theory 12(1): 11-15 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
