Songling Shan

Learn More
A spanning tree T of a graph G is called a homeomorphically irreducible spanning tree (HIST) if T does not contain vertices of degree 2. A graph G is called locally connected if for every vertex v ∈ V (G), the subgraph induced by the neighborhood of v is connected. In this paper, we prove that every connected and locally connected graph with more than 3(More)
The well-known Chvátal–Erd˝ os Theorem states that every graph G of order at least three with α(G) ≤ κ(G) has a hamiltonian cycle, where α(G) and κ(G) are the independence number and the connectivity of G, respectively. Oberly and Sumner [J. Graph Theory 3 (1979), 351–356] have proved that every connected, locally-connected claw-free graph of order at least(More)
The square of a graph is obtained by adding additional edges joining all pair of vertices of distance two in the original graph. Particularly, if C is a hamiltonian cycle of a graph G, then the square of C is called a hamiltonian square of G. In this paper, we characterize all possible forbidden pairs, which implies the containment of a hamiltonian square,(More)
Corrádi and Hajnal [1] showed that any graph of order at least 3k with minimum degree at least 2k contains k vertex-disjoint cycles. This minimum degree condition is sharp, because the complete bipartite graph K 2k−1,n−2k+1 does not contain k vertex-disjoint cycles. About the existence of vertex-disjoint cycles of the same length, Thomassen [4] conjectured(More)
A Halin graph, defined by Halin [6], is a plane graph H = T ∪ C such that T is a spanning tree of H with no vertices of degree 2 where |T | ≥ 4 and C is a cycle whose vertex set is the set of leaves of T. In his work, as an example of a class of edge-minimal 3-connected plane graphs, Halin constructed this family of plane graphs. Although it was proved that(More)
  • 1