Jingzhong Mao

According to our database, Jingzhong Mao authored at least 14 papers between 1992 and 2005.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2005

Supereulerian planar graphs.

Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan Zhan

Ars Comb., 2005

2004

Erratum to: The structure of geodetic blocks with diameter two.

Jingzhong Mao, Lingli Sun

J. Graph Theory, 2004

On maximum number of edges in a spanning eulerian subgraph.

Dengxin Li, Deying Li, Jingzhong Mao

Discret. Math., 2004

Optimal Capacity Expansion Arc Algorithm on Networks.

Yuhua Liu, Shengsheng Yu, Jingzhong Mao, Peng Yang

Proceedings of the Computational and Information Science, First International Symposium, 2004

2003

Minimally (<i>k, k</i>)-edge-connected graphs.

Kamal Hennayake, Hong-Jian Lai, Deying Li, Jingzhong Mao

J. Graph Theory, 2003

Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs.

Zhi-Hong Chen, Hong-Jian Lai, Xiangwen Li, Deying Li, Jingzhong Mao

J. Graph Theory, 2003

New types of integral sum graphs.

Jianqiang Wu, Jingzhong Mao, Deying Li

Discret. Math., 2003

Total domination and least domination in a tree.

Xuezheng Lv, Jingzhong Mao

Discret. Math., 2003

Minimally (k, k-1)-edge-connected graphs.

Xiang-Feng Pan, Jingzhong Mao, Huiqing Liu

Australas. J Comb., 2003

2002

A proof of a conjecture of minus domination in graphs.

Chunxiang Wang, Jingzhong Mao

Discret. Math., 2002

2001

Some more remarks on domination in cubic graphs.

Chunxiang Wang, Jingzhong Mao

Discret. Math., 2001

1999

A new upper bound on the number of edges in a geodetic graph.

Jingzhong Mao, Deying Li

Discret. Math., 1999

1997

A Sharp Lower Bound for the Number of Connectivity-Redundant Nodes.

Serge Lawrencenko, Jingzhong Mao

Ars Comb., 1997

1992

The structure of geodetic blocks with diameter two.

Jingzhong Mao

J. Graph Theory, 1992