| 2005 |
|---|
| 10 | | Hong-Jian Lai,
Deying Li,
Jingzhong Mao,
Mingquan Zhan:
Supereulerian planar graphs.
Ars Comb. 75: (2005) |
| 2004 |
|---|
| 9 | EE | Yuhua Liu,
Shengsheng Yu,
Jingzhong Mao,
Peng Yang:
Optimal Capacity Expansion Arc Algorithm on Networks.
CIS 2004: 105-110 |
| 8 | EE | Dengxin Li,
Deying Li,
Jingzhong Mao:
On maximum number of edges in a spanning eulerian subgraph.
Discrete Mathematics 274(1-3): 299-302 (2004) |
| 7 | EE | Jingzhong Mao,
Lingli Sun:
Erratum to: The structure of geodetic blocks with diameter two.
Journal of Graph Theory 46(1): 79-80 (2004) |
| 2003 |
|---|
| 6 | EE | Jianqiang Wu,
Jingzhong Mao,
Deying Li:
New types of integral sum graphs.
Discrete Mathematics 260(1-3): 163-176 (2003) |
| 5 | EE | Xuezheng Lv,
Jingzhong Mao:
Total domination and least domination in a tree.
Discrete Mathematics 265(1-3): 401-404 (2003) |
| 2002 |
|---|
| 4 | EE | Chunxiang Wang,
Jingzhong Mao:
A proof of a conjecture of minus domination in graphs.
Discrete Mathematics 256(1-2): 519-521 (2002) |
| 2001 |
|---|
| 3 | EE | Chunxiang Wang,
Jingzhong Mao:
Some more remarks on domination in cubic graphs.
Discrete Mathematics 237(1-3): 193-197 (2001) |
| 1999 |
|---|
| 2 | EE | Jingzhong Mao,
Deying Li:
A new upper bound on the number of edges in a geodetic graph.
Discrete Mathematics 202(1-3): 183-189 (1999) |
| 1997 |
|---|
| 1 | | Serge Lawrencenko,
Jingzhong Mao:
A Sharp Lower Bound for the Number of Connectivity-Redundant Nodes.
Ars Comb. 47: (1997) |
