#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2000

2018

- This year (1)
- Last 5 years (5)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Mingquan Zhan, Seang Mei Saw, +5 authors Sek Jin Chew
- Optometry and vision science : official…
- 2000

PURPOSE
To compare and contrast the prevalence of myopia and other refractive errors in Xiamen city, Xiamen countryside (Southern China), and Singapore.
METHODS
One hundred thirty-two… (More)

- Hong-Jian Lai, Yehong Shao, Mingquan Zhan
- Discrete Mathematics
- 2008

Let G be a graph. For any two distinct vertices x and y in G, denote distG(x, y) the distance in G from x and y. For u, v ∈ V (G) with distG(u, v) = 2, denote JG(u, v) = {w ∈ NG(u)∩NG(v)|N(w) ⊆ N… (More)

- Dengxin Li, Hong-Jian Lai, Mingquan Zhan
- Discrete Applied Mathematics
- 2005

Let C(l, k) denote a class of 2-edge-connected graphs of order n such that a graph G ∈ C(l, k) if and only if for every edge cut S ⊆ E(G) with |S| ≤ 3, each component of G − S has order at least n− k… (More)

In 1950s, Tutte introduced the theory of nowhere-zero flows as a tool to investigate the coloring problem of maps, together with his most fascinating conjectures on nowhere-zero flows. These have… (More)

- Mingquan Zhan
- Discrete Applied Mathematics
- 2010

- Hong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan
- Discrete Applied Mathematics
- 2009

We investigate graphs G such that the line graph L(G) is hamiltonian connected if and only if L(G) is 3-connected, and prove that if each 3-edge-cut contains an edge lying in a short cycle of G, then… (More)

- Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan Zhan
- Ars Comb.
- 2005

We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoint spanning trees,… (More)

A graph G is N2-locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryjáček conjectured that… (More)

- Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan, Mingquan Zhan
- Discrete Mathematics
- 2009

Let G be an undirected graph that is neither a path nor a cycle. Clark and Wormald [L.H. Clark, N.C. Wormald, Hamiltonian-like indices of graphs, ARS Combinatoria 15 (1983) 131–148] defined hc(G) to… (More)

- Zhi-Hong Chen, Miaomiao Han, Hong-Jian Lai, Mingquan Zhan
- Graphs and Combinatorics
- 2015

If a graph G has three even subgraphs C1, C2 and C3 such that every edge of G lies in exactly two members of {C1, C2, C3}, then we say that G has a 3-cycle-2-cover. Let S3 denote the family of graphs… (More)