Jingzhong Mao

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