Stop the war!Остановите войну!
for scientists:
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
- 2023
[j240]Lingmei Liang, Fengxia Liu
, Hong-Jian Lai:
On list r-hued coloring of outer-1-planar graphs. Appl. Math. Comput. 440: 127658 (2023)- [j239]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) - [j238]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) - [j237]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
- [j236]Juan Liu, Shupeng Li, Xindong Zhang, Hong-Jian Lai:
Hamiltonian index of directed multigraph. Appl. Math. Comput. 425: 127074 (2022) - [j235]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) - [j234]Jianbing Liu, Miaomiao Han, Hong-Jian Lai:
Weighted Modulo Orientations of Graphs and Signed Graphs. Electron. J. Comb. 29(4) (2022) - [j233]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) - [j232]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) - [j231]Ye Chen, Suohai Fan, Hong-Jian Lai, Murong Xu:
Graph r-hued colorings - A survey. Discret. Appl. Math. 321: 24-48 (2022) - [j230]Xiaoxia Lin, Keke Wang, Meng Zhang, Hong-Jian Lai:
Bounding ℓ-edge-connectivity in edge-connectivity. Discret. Appl. Math. 321: 350-356 (2022) - [j229]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) - [j228]Ruifang Liu, Hong-Jian Lai, Rao Li:
Hamiltonian s-properties and eigenvalues of k-connected graphs. Discret. Math. 345(4): 112774 (2022) - [j227]Xia Liu, Sulin Song, Hong-Jian Lai:
Hamiltonian line graphs with local degree conditions. Discret. Math. 345(6): 112825 (2022) - [j226]Jianbing Liu, Miaomiao Han, Hong-Jian Lai:
Modulo orientations and matchings in graphs. Discret. Math. 345(7): 112877 (2022) - [j225]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) - [j224]Sulin Song, Lan Lei, Yehong Shao, Hong-Jian Lai:
Asymptotically sharpening the $s$-Hamiltonian index bound. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j223]Liqiong Xu, Hong-Jian Lai, Yingzhi Tian, Murong Xu:
The Extremal Sizes of Arc-Maximal (k, l)-Digraphs. Graphs Comb. 38(3): 72 (2022) - [j222]Xiaofeng Gu, Hong-Jian Lai, Sulin Song:
On hamiltonian line graphs of hypergraphs. J. Graph Theory 100(3): 489-503 (2022) - [j221]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
- [j220]Ruichao Niu, Min Xu, Hong-Jian Lai:
Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube. Appl. Math. Comput. 400: 126090 (2021) - [j219]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) - [j218]Jiang Zhou, Changjiang Bu, Hong-Jian Lai:
Edge-disjoint spanning trees and forests of graphs. Discret. Appl. Math. 299: 74-81 (2021) - [j217]Juan Liu, Omaema Lasfar, Jia Wei, Xindong Zhang, Hong-Jian Lai:
Matching and spanning trails in digraphs. Discret. Appl. Math. 304: 417-431 (2021) - [j216]Xiaoling Ma, Yang Wu, Mingquan Zhan, Hong-Jian Lai:
On s-hamiltonicity of net-free line graphs. Discret. Math. 344(1): 112173 (2021) - [j215]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) - [j214]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) - [j213]Juan Liu, Hong Yang, Hong-Jian Lai, Xindong Zhang:
Symmetric core and spanning trails in directed networks. Discret. Math. 344(11): 112584 (2021) - [j212]Wei Xiong, Sulin Song, Hong-Jian Lai:
Polynomially determine if a graph is (s, 3)-supereulerian. Discret. Math. 344(12): 112601 (2021) - [j211]Mansour J. Algefari, Hong-Jian Lai:
Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree. Graphs Comb. 37(1): 55-64 (2021) - [j210]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) - [j209]Hong-Jian Lai, Lucian Mazza:
Group Colorings and DP-Colorings of Multigraphs Using Edge-Disjoint Decompositions. Graphs Comb. 37(6): 2227-2243 (2021) - [j208]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) - [j207]Hong-Jian Lai, Lucian Mazza:
A Note on Group Colorings and Group Structure. SIAM J. Discret. Math. 35(4): 2535-2543 (2021) - 2020
- [j206]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) - [j205]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) - [j204]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) - [j203]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) - [j202]Miaomiao Han, Hong-Jian Lai, Jiaao Li, Yezhou Wu:
Contractible graphs for flow index less than three. Discret. Math. 343(11): 112073 (2020) - [j201]Jian-Bing Liu, Ping Li, Jiaao Li, Hong-Jian Lai:
On weighted modulo orientation of graphs. Eur. J. Comb. 89: 103163 (2020) - [j200]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) - [j199]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) - [j198]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
- [j197]Jia Wei, Zhifu You, Hong-Jian Lai:
Spectral analogues of Erdős' theorem on Hamilton-connected graphs. Appl. Math. Comput. 340: 242-250 (2019) - [j196]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) - [j195]Miaomiao Han, Hong-Jian Lai, Jianping Liu:
Modulo 5-orientations and degree sequences. Discret. Appl. Math. 260: 155-163 (2019) - [j194]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) - [j193]Hong-Jian Lai, Jiaao Li:
Packing spanning trees in highly essentially connected graphs. Discret. Math. 342(1): 1-9 (2019) - [j192]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) - [j191]Muhuo Liu, Hong-Jian Lai, Kinkar Chandra Das:
Spectral results on Hamiltonian problem. Discret. Math. 342(6): 1718-1730 (2019) - [j190]Hong-Jian Lai, Xuezheng Lv, Murong Xu:
On r-hued colorings of graphs without short induced paths. Discret. Math. 342(7): 1904-1911 (2019) - [j189]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) - [j188]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) - [j187]Yingzhi Tian, Hong-Jian Lai, Jixiang Meng:
On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs. Graphs Comb. 35(5): 1001-1010 (2019) - [j186]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
- [j185]Tingzeng Wu, Hong-Jian Lai:
On the permanental sum of graphs. Appl. Math. Comput. 331: 334-340 (2018) - [j184]Ping Li, Keke Wang, Mingquan Zhan, Hong-Jian Lai:
Strongly Spanning Trailable Graphs with Short Longest Paths. Ars Comb. 137: 3-39 (2018) - [j183]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) - [j182]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) - [j181]Mansour J. Algefari, Hong-Jian Lai, Jinquan Xu:
Locally dense supereulerian digraphs. Discret. Appl. Math. 238: 24-31 (2018) - [j180]Huimin Song, Hong-Jian Lai:
Upper bounds of r-hued colorings of planar graphs. Discret. Appl. Math. 243: 262-269 (2018) - [j179]Miaomiao Han, Hong-Jian Lai, Jiaao Li:
Modulo orientations with bounded independence number. Discret. Appl. Math. 247: 14-22 (2018) - [j178]Xiaofeng Gu, Hong-Jian Lai:
A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs. Discret. Math. 341(2): 400-404 (2018) - [j177]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) - [j176]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) - [j175]Jianping Liu, Aimei Yu, Keke Wang, Hong-Jian Lai:
Degree sum and hamiltonian-connected line graphs. Discret. Math. 341(5): 1363-1379 (2018) - [j174]Tingzeng Wu, Hong-Jian Lai:
Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral. Graphs Comb. 34(6): 1713-1721 (2018) - [j173]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) - [j172]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) - [j171]Xiaomin Li, Lan Lei, Hong-Jian Lai:
The connectivity of generalized graph products. Inf. Process. Lett. 136: 37-40 (2018) - [j170]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) - [j169]Xindong Zhang, Juan Liu, Lan Wang, Hong-Jian Lai:
Supereulerian bipartite digraphs. J. Graph Theory 89(1): 64-75 (2018) - [j168]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) - [j167]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
- [j166]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) - [j165]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) - [j164]Hao Li, Hong-Jian Lai, Yang Wu, Shuzhen Zhu:
Panconnected index of graphs. Discret. Math. 340(5): 1092-1097 (2017) - [j163]Wei Xiong, Jinquan Xu, Zhengke Miao, Yang Wu, Hong-Jian Lai:
Supereulerian width of dense graphs. Discret. Math. 340(12): 2995-3001 (2017) - [j162]Zhen-Kun Zhang, Hong-Jian Lai:
Characterizations of k-cutwidth critical trees. J. Comb. Optim. 34(1): 233-244 (2017) - [j161]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: 167-186 (2017) - [j160]Janet Anderson, Hong-Jian Lai, Xiaoxia Lin, Murong Xu:
On k-Maximal Strength Digraphs. J. Graph Theory 84(1): 17-25 (2017) - [j159]Yanmei Hong, Qinghai Liu, Hong-Jian Lai:
Characterization of Digraphic Sequences with Strongly Connected Realizations. J. Graph Theory 84(2): 191-201 (2017) - [j158]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
- [j157]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) - [j156]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) - [j155]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) - [j154]Yanmei Hong, Xiaofeng Gu, Hong-Jian Lai, Qinghai Liu:
Fractional spanning tree packing, forest covering and eigenvalues. Discret. Appl. Math. 213: 219-223 (2016) - [j153]Aimei Yu, Jianping Liu, Miaomiao Han, Hong-Jian Lai:
On dense strongly Z2s-1-connected graphs. Discret. Math. 339(2): 850-856 (2016) - [j152]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) - [j151]Yanmei Hong, Qinghai Liu, Hong-Jian Lai:
Ore-type degree condition of supereulerian digraphs. Discret. Math. 339(8): 2042-2050 (2016) - [j150]Xiaoxia Lin, Suohai Fan, Hong-Jian Lai, Murong Xu:
On the lower bound of k-maximal digraphs. Discret. Math. 339(10): 2500-2510 (2016) - [j149]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) - [j148]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) - [j147]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) - [j146]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) - [j145]Xinmin Hou, Hong-Jian Lai, Cun-Quan Zhang:
On Perfect Matching Coverings and Even Subgraph Coverings. J. Graph Theory 81(1): 83-91 (2016) - [j144]Mansour J. Algefari, Hong-Jian Lai:
Supereulerian Digraphs with Large Arc-Strong Connectivity. J. Graph Theory 81(4): 393-402 (2016) - [j143]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
- [j142]Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
K-5-factor in a Graph. Ars Comb. 122: 97-124 (2015) - [j141]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) - [j140]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
- [j139]Hong-Jian Lai, Bolian Liu, Ju Zhou:
Bounds of eigenvalues of a nontrivial bipartite graph. Ars Comb. 113: 341-351 (2014) - [j138]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) - [j137]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) - [j136]Zhaohong Niu, Liang Sun, Liming Xiong, Hong-Jian Lai, Huiya Yan:
On extremal k-supereulerian graphs. Discret. Math. 314: 50-60 (2014) - [j135]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) - [j134]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) - [j133]Yanmei Hong, Hong-Jian Lai, Qinghai Liu:
Supereulerian digraphs. Discret. Math. 330: 87-95 (2014) - [j132]Fan Yang, Xiangwen Li, Hong-Jian Lai:
Realizing degree sequences as Z3-connected graphs. Discret. Math. 333: 110-119 (2014) - [j131]Weihua Yang, Hong-Jian Lai, Hao Li, Xiaofeng Guo:
Collapsible Graphs and Hamiltonicity of Line Graphs. Graphs Comb. 30(2): 501-510 (2014) - [j130]Xiaofeng Gu, Hong-Jian Lai, Ping Li, Senmei Yao:
Characterizations of Strength Extremal Graphs. Graphs Comb. 30(6): 1453-1461 (2014) - [j129]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) - [j128]Wei Xiong, Zhao Zhang, Hong-Jian Lai:
Spanning 3-connected index of graphs. J. Comb. Optim. 27(1): 199-208 (2014) - [j127]Ping Li, Hong-Jian Lai:
On Mod (2s+1)-Orientations of Graphs. SIAM J. Discret. Math. 28(4): 1820-1827 (2014) - 2013
- [j126]Hao Li, Hong-Jian Lai:
Group colorability of multigraphs. Discret. Math. 313(1): 101-104 (2013) - [j125]Yanmei Hong, Hong-Jian Lai:
Non-separating subgraphs. Discret. Math. 313(4): 391-396 (2013) - [j124]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) - [j123]Xiaofeng Gu, Hong-Jian Lai:
Realizing degree sequences with k-edge-connected uniform hypergraphs. Discret. Math. 313(11): 1394-1400 (2013) - [j122]