Skip to main content

3 Result(s)

within **aohong Niu Remove this filter Combinatorics Remove this filter

and

  1. No Access

    Article

    On Traceable Line Graphs

    Let G be a simple graph of order n and D 1(G) be the set of vertices of degree 1 in G. In this paper, we prove that if G − D 1(G) is 2-edge-connected and if for every edge ...

    Zhaohong Niu, Liming **ong in Graphs and Combinatorics (2015)

  2. No Access

    Article

    On Hamiltonicity of 3-Connected Claw-Free Graphs

    Lai, Shao and Zhan (J Graph Theory 48:142–146, 2005) showed that every 3-connected N 2-locally connected claw-free graph is Hamiltonian. In this paper, we generalize this result and show that ever...

    Runli Tian, Liming **ong, Zhaohong Niu in Graphs and Combinatorics (2014)

  3. No Access

    Article

    Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs

    For integers l and k with l > 0 and k > 0, let \({{\fancyscript{C}}(l, k)}\) denote the family of 2-edge-connected gr...

    **angwen Li, Chunxiang Wang, Qiong Fan, Zhaohong Niu… in Graphs and Combinatorics (2013)