Dengju Ma

According to our database, Dengju Ma authored at least 11 papers between 2005 and 2024.

Collaborative distances:

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

2024

The decycling number of a planar graph covered by <i>K₄</i>-subgraphs.

Dengju Ma, Mingyuan Ma, Han Ren

Discuss. Math. Graph Theory, 2024

2023

A (2<i>k</i> + 1)-regular graph with page-number <i>k</i>.

Dengju Ma

Discret. Math., 2023

2019

The orientable genus of the join of a cycle and a complete graph.

Dengju Ma, Han Ren

Ars Math. Contemp., 2019

2017

The orientable genus of the generalized Petersen graph P(km, m).

Dengju Ma, Han Ren

Ars Comb., 2017

The crossing number of the strong product of two paths.

Dengju Ma

Australas. J Comb., 2017

2015

L(2, 1)-labeling of a circular graph.

Dengju Ma, Han Ren, Damei Lv

Ars Comb., 2015

2014

$$\lambda $$ -numbers of several classes of snarks.

Dengju Ma, Hengfeng Zhu, Jianbao He

J. Comb. Optim., 2014

L(p, q)-labeling of a graph embeddable on the torus.

Dengju Ma

Discret. Appl. Math., 2014

2010

Petersen Graph Decompositions of Complete Multipartite Graphs.

Jinhua Wang, Dengju Ma

Graphs Comb., 2010

2008

The projective plane crossing numbers of circular graphs.

Dengju Ma, Han Ren

J. Syst. Sci. Complex., 2008

2005

The crossing number of the circular graph C(2<i>m</i>+2, <i>m</i>).

Dengju Ma, Han Ren, Junjie Lu

Discret. Math., 2005