hamiltonian line graphs
Recently Published Documents


TOTAL DOCUMENTS

19
(FIVE YEARS 2)

H-INDEX

9
(FIVE YEARS 1)

2022 ◽  
Author(s):  
Xiaofeng Gu ◽  
Hong‐Jian Lai ◽  
Sulin Song

2019 ◽  
Vol 342 (11) ◽  
pp. 3006-3016 ◽  
Author(s):  
Hong-Jian Lai ◽  
Mingquan Zhan ◽  
Taoye Zhang ◽  
Ju Zhou

10.37236/4511 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
Wei-Guo Chen ◽  
Zhi-Hong Chen ◽  
Mei Lu

A graph is supereulerian if it has a spanning closed trail. For an integer $r$, let ${\cal Q}_0(r)$ be  the family of 3-edge-connected nonsupereulerian graphs of order at most $r$. For a graph $G$, define $\delta_L(G)=\min\{\max\{d(u), d(v) \}| \  \mbox{ for any $uv\in E(G)$} \}$. For a given integer $p\ge 2$ and a given real number $\epsilon$,  a graph $G$ of order $n$ is said to satisfy a Lai's condition if $\delta_L(G)\ge \frac{n}{p}-\epsilon$.  In this paper, we show that  if $G$ is  a  3-edge-connected graph of order $n$ with $\delta_L(G)\ge \frac{n}{p}-\epsilon$, then there is an integer $N(p, \epsilon)$ such that when $n> N(p,\epsilon)$, $G$ is supereulerian if and only if $G$ is not  a graph obtained from a  graph $G_p$ in the finite family ${\cal Q}_0(3p-5)$ by replacing some vertices in $G_p$ with nontrivial graphs. Results on the best possible Lai's  conditions for Hamiltonian line graphs of 3-edge-connected graphs or 3-edge-connected supereulerian graphs are given,  which are improvements of the results in [J. Graph Theory 42(2003) 308-319] and in [Discrete Mathematics, 310(2010) 2455-2459].


2013 ◽  
Vol 74 (3) ◽  
pp. 344-358 ◽  
Author(s):  
Hong-Jian Lai ◽  
Yehong Shao

2012 ◽  
Vol 312 (11) ◽  
pp. 1877-1882
Author(s):  
Ye Chen ◽  
Suohai Fan ◽  
Hong-Jian Lai

2003 ◽  
Vol 42 (4) ◽  
pp. 308-319 ◽  
Author(s):  
Zhi-Hong Chen ◽  
Hong-Jian Lai ◽  
Xiangwen Li ◽  
Deying Li ◽  
Jinzhong Mao

1995 ◽  
Vol 138 (1-3) ◽  
pp. 379-385 ◽  
Author(s):  
E. van Blanken ◽  
J. van den Heuvel ◽  
H.J. Veldman

Sign in / Sign up

Export Citation Format

Share Document