52 citations · 100 across the 32 of their papers we have counts for
6 papers · 1 filter
Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs
Bo Ning, Shenggui Zhang, Bing Chen
Let claw be the graph . A graph on vertices is called \emph{o}-heavy if each induced claw of has a pair of end-vertices with degree sum at least , and…
Rainbow triangles in edge-colored graphs
Binlong Li, Bo Ning, Chuandong Xu +1
Let be an edge-colored graph. The color degree of a vertex of , is defined as the number of colors of the edges incident to . The color number of is defined as th…
Two sufficient conditions for the existence of Hamilton cycles in graphs
Bo Ning, Bing Chen, Shenggui Zhang
Let be a graph on vertices, claw the bipartite graph , and the graph obtained from a triangle by attaching a path of length to its one vertex. …
Star subdivisions and connected even factors in the square of a graph
Jan Ekstein, Přemysl Holub, Tomáš Kaiser +2
For any positive integer , a -factor in a graph is a connected even factor with maximum degree at most . We prove that if every induced in a gra…
Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
Bo Ning, Shenggui Zhang
Bedrossian characterized all pairs of forbidden subgraphs for a 2-connected graph to be Hamiltonian. Instead of forbidding some induced subgraphs, we relax the conditions for graph…
A note on heterochromatic cycles of length 4 in edge-colored graphs
Bo Ning, Shenggui Zhang
Let be an edge-colored graph. A heterochromatic cycle of is one in which every two edges have different colors. For a vertex , let denote the set of colo…