# Meirun Chen

According to our database

Collaborative distances:

^{1}, Meirun Chen authored at least 13 papers between 2009 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

The optimal routing of augmented cubes.

Inf. Process. Lett., 2018

Graphs with Almost All Edges in Long Cycles.

Graphs and Combinatorics, 2018

2016

Fault-Tolerant Adaptive Routing in n-D Mesh.

Proceedings of the Web-Age Information Management, 2016

2014

Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model.

J. Applied Mathematics, 2014

Total chromatic number of generalized Mycielski graphs.

Discrete Mathematics, 2014

Total and adjacent vertex-distinguishing total chromatic numbers of augmented cubes.

Ars Comb., 2014

2013

Total chromatic number of folded hypercubes.

Ars Comb., 2013

2011

The optimal strong radius and optimal strong diameter of the Cartesian product graphs.

Appl. Math. Lett., 2011

2010

On Vertex-Distinguishing Proper Edge Colorings of Graphs Satisfying the Ore Condition.

Ars Comb., 2010

Lower and Upper Orientable Strong Radius and Strong Diameter of the Cartesian Product of Complete Graphs.

Ars Comb., 2010

2009

On f-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes.

Inf. Process. Lett., 2009

Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes.

Inf. Process. Lett., 2009

Lower and upper orientable strong diameters of graphs satisfying the Ore condition.

Appl. Math. Lett., 2009