#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2010

2015

- This year (0)
- Last 5 years (6)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Zhaohong Niu, Liming Xiong
- Discrete Applied Mathematics
- 2010

- Zhaohong Niu, Hong-Jian Lai, Liming Xiong
- Discrete Mathematics
- 2012

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a b s t r a c t A graph is k-supereulerian if it has a spanning even subgraph with at… (More)

- Zhaohong Niu, Liming Xiong
- Australasian J. Combinatorics
- 2010

Let G be a connected simple graph of order n, k a positive integer and n sufficiently large relative to k. An even factor of G is a spanning subgraph of G in which every vertex has even positive degree. In this paper, we prove that if δ(G) ≥ ≥n/k − 1, then the (collapsible) reduction G of G satisfies |V (G)| ≤ k, and the preimage of each vertex of G is… (More)

- Runli Tian, Liming Xiong, Zhaohong Niu
- Discrete Mathematics
- 2012

- Xiangwen Li, Chunxiang Wang, Qiong Fan, Zhaohong Niu, Liming Xiong
- Graphs and Combinatorics
- 2013

A graph G is called k-supereulerian if it has a spanning even subgraph with at most k components. In this paper, we prove that any 2-edge-connected loopless graph of order n is ⌈(n − 2)/3⌉-supereulerian, with only one exception. This result solves a conjecture in [Z. Niu, L. Xiong, Even factor of a graph with a bounded number of components, Australas. J. As… (More)

- Zhaohong Niu, Liming Xiong
- Graphs and Combinatorics
- 2015

- Runli Tian, Liming Xiong, Zhaohong Niu
- Graphs and Combinatorics
- 2014

A graph G has the hourglass property if every induced hourglass S (a tree with a degree sequence 22224) contains two non-adjacent vertices which have a common neighbor in G − V (S). For an integer k ≥ 4, a graph G has the single k-cycle property if every edge of G, which does not lie in a triangle, lies in a cycle C of order at most k such that C has at… (More)

- ‹
- 1
- ›