Jingzhong Mao - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 14 from 14

2005

Supereulerian planar graphsHong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan Zhan. arscom, 75, 2005.

2004

On maximum number of edges in a spanning eulerian subgraphDengxin Li, Deying Li, Jingzhong Mao. DM, 274(1-3):299-302, 2004. [doi]

Optimal Capacity Expansion Arc Algorithm on NetworksYuhua Liu, Shengsheng Yu, Jingzhong Mao, Peng Yang. cis 2004: 105-110 [doi]

Erratum to: The structure of geodetic blocks with diameter twoJingzhong Mao, Lingli Sun. jgt, 46(1):79-80, 2004. [doi]

2003

Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphsZhi-Hong Chen, Hong-Jian Lai, Xiangwen Li, Deying Li, Jingzhong Mao. jgt, 42(4):308-319, 2003. [doi]

k, k)-edge-connected graphsKamal Hennayake, Hong-Jian Lai, Deying Li, Jingzhong Mao. jgt, 44(2):116-131, 2003. [doi]

Total domination and least domination in a treeXuezheng Lv, Jingzhong Mao. DM, 265(1-3):401-404, 2003. [doi]

Minimally (k, k-1)-edge-connected graphsXiang-Feng Pan, Jingzhong Mao, Huiqing Liu. ajc, 28:39-50, 2003. [doi]

New types of integral sum graphsJianqiang Wu, Jingzhong Mao, Deying Li. DM, 260(1-3):163-176, 2003. [doi]

2002

A proof of a conjecture of minus domination in graphsChunxiang Wang, Jingzhong Mao. DM, 256(1-2):519-521, 2002. [doi]

2001

Some more remarks on domination in cubic graphsChunxiang Wang, Jingzhong Mao. DM, 237(1-3):193-197, 2001. [doi]

1999

A new upper bound on the number of edges in a geodetic graphJingzhong Mao, Deying Li. DM, 202(1-3):183-189, 1999. [doi]

1997

A Sharp Lower Bound for the Number of Connectivity-Redundant NodesSerge Lawrencenko, Jingzhong Mao. arscom, 47, 1997.

1992

The structure of geodetic blocks with diameter twoJingzhong Mao. jgt, 16(3):247-255, 1992. [doi]

Sign in or sign up to see more results.

runs on WebDSL