Jingzhong Mao

Publication Activity (10 Years)

Years Active: 1992-2005
Publications (10 Years): 0

Publications

Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan Zhan
Supereulerian planar graphs. Ars Comb. 75 (2005)
Dengxin Li, Deying Li, Jingzhong Mao
On maximum number of edges in a spanning eulerian subgraph. Discret. Math. 274 (1-3) (2004)
Yuhua Liu, Shengsheng Yu, Jingzhong Mao, Peng Yang
Optimal Capacity Expansion Arc Algorithm on Networks. CIS (2004)
Jingzhong Mao, Lingli Sun
Erratum to: The structure of geodetic blocks with diameter two. J. Graph Theory 46 (1) (2004)
Zhi-Hong Chen, Hong-Jian Lai, Xiangwen Li, Deying Li, Jingzhong Mao
Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs. J. Graph Theory 42 (4) (2003)
Xuezheng Lv, Jingzhong Mao
Total domination and least domination in a tree. Discret. Math. 265 (1-3) (2003)
Xiang-Feng Pan, Jingzhong Mao, Huiqing Liu
Minimally (k, k-1)-edge-connected graphs. Australas. J Comb. 28 (2003)
Kamal Hennayake, Hong-Jian Lai, Deying Li, Jingzhong Mao
)-edge-connected graphs. J. Graph Theory 44 (2) (2003)
Jianqiang Wu, Jingzhong Mao, Deying Li
New types of integral sum graphs. Discret. Math. 260 (1-3) (2003)
Chunxiang Wang, Jingzhong Mao
A proof of a conjecture of minus domination in graphs. Discret. Math. 256 (1-2) (2002)
Chunxiang Wang, Jingzhong Mao
Some more remarks on domination in cubic graphs. Discret. Math. 237 (1-3) (2001)
Jingzhong Mao, Deying Li
A new upper bound on the number of edges in a geodetic graph. Discret. Math. 202 (1-3) (1999)
Serge Lawrencenko, Jingzhong Mao
A Sharp Lower Bound for the Number of Connectivity-Redundant Nodes. Ars Comb. 47 (1997)
Jingzhong Mao
The structure of geodetic blocks with diameter two. J. Graph Theory 16 (3) (1992)