D. Christopher Stephens

According to our database, D. Christopher Stephens authored at least 8 papers between 2007 and 2021.

Collaborative distances:

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

2021

Connectivity for Kite-Linked Graphs.

Runrun Liu, Martin Rolek, D. Christopher Stephens, Dong Ye, Gexin Yu

SIAM J. Discret. Math., 2021

2014

Representativity of Cayley maps.

D. Christopher Stephens, Thomas W. Tucker, Xiaoya Zha

Eur. J. Comb., 2014

2013

Subdivisions of <i>K</i>₅ in Graphs Embedded on Surfaces With Face-Width at Least 5.

Roi Krakovski, D. Christopher Stephens, Xiaoya Zha

J. Graph Theory, 2013

2011

Structure of 4-connected claw-free graphs not containing a subdivision of K₅.

Roi Krakovski, D. Christopher Stephens

Discret. Math., 2011

2010

Equitable Coloring of Sparse Planar Graphs.

Rong Luo, Jean-Sébastien Sereni, D. Christopher Stephens, Gexin Yu

SIAM J. Discret. Math., 2010

2009

The orientable genus of some joins of complete graphs with large edgeless graphs.

Mark N. Ellingham, D. Christopher Stephens

Discret. Math., 2009

2008

Spanning subsets of toroidal and Klein bottle embeddings.

D. Christopher Stephens, Xiaoya Zha

Electron. Notes Discret. Math., 2008

2007

The nonorientable genus of joins of complete graphs with large edgeless graphs.

Mark N. Ellingham, D. Christopher Stephens

J. Comb. Theory B, 2007