id: 06042119
dt: j
an: 06042119
au: Kan, Yongzhi; Liu, Chunfeng
ti: A new result on Hamilton line graph.
so: Pure Appl. Math. 27, No. 4, 442-449, 458 (2011).
py: 2011
pu: Northwest University, Department of Mathematics, Xian
la: ZH
cc: 
ut: Hamiltonian line graph; $D$-circuits; almost bridgeless graph; four verices
    road; Hamilton cycle
ci: 
li: 
ab: Summary: Let $H$ be a simple graph, for $H_1\subseteq H$ let $d(H_1) =
    \sum_{v\in V(H_1)}d(v)$, where $v$ is a vertex and $d(v)$ its degree.
    The main result is as follows: Let $G$ be a simple connected, almost
    bridgeless graph of order $n \geq 3$, $G \neq K_{(1,n-1)}$, $Q_1$ and
    $Q_2$. If $d(I) \geq 2n-6$ for each induced subgraph $I$ isomorphic to
    the 4 vertices road, then the line graph $L(G)$ of $G$ has Hamiltonian
    cycles.
rv: