The SCEAS System
| |||||||

## Search the dblp DataBase
Mark N. Ellingham:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Mark N. Ellingham, Luis A. Goddyn
**List Edge Colourings of Some 1-Factorable Multigraphs.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1996, v:16, n:3, pp:343-352 [Journal] - Mark N. Ellingham, Derek A. Holton, Charles H. C. Little
**Cycles through ten vertices in 3-connected cubic graphs.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1984, v:4, n:4, pp:265-273 [Journal] - Mark N. Ellingham, Chris Stephens, Xiaoya Zha
**Counterexamples to the nonorientable genus conjecture for complete tripartite graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2005, v:26, n:3-4, pp:387-399 [Journal] - Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger
**Colorability of Planar Graphs with Isolated Nontriangular Faces.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2004, v:20, n:4, pp:443-446 [Journal] - Mark N. Ellingham, Xiaoya Zha
**Separating Cycles in Doubly Toroidal Embeddings.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2003, v:19, n:2, pp:161-175 [Journal] - Richard Brunet, Mark N. Ellingham, Zhicheng Gao, Alice Metzlar, R. Bruce Richter
**Spanning Planar Subgraphs of Graphs in the Torus and Klein Bottle.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1995, v:65, n:1, pp:7-22 [Journal] - Mark N. Ellingham
**Vertex-Switching Reconstruction and Folded Cubes.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:361-364 [Journal] - Mark N. Ellingham, Zhicheng Gao
**Spanning Trees in Locally Planar Triangulations.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1994, v:61, n:2, pp:178-198 [Journal] - Mark N. Ellingham, Joseph Douglas Horton
**Non-hamiltonian 3-connected cubic bipartite graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1983, v:34, n:3, pp:350-353 [Journal] - Mark N. Ellingham, Gordon F. Royle
**Vertex-switching reconstruction of subgraph numbers and triangle-free graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:167-177 [Journal] - Mark N. Ellingham, Xiaoya Zha
**The Spectral Radius of Graphs on Surfaces.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2000, v:78, n:1, pp:45-56 [Journal] - Mark N. Ellingham, Chris Stephens, Xiaoya Zha
**The nonorientable genus of complete tripartite graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:529-559 [Journal] - Mark N. Ellingham, Ken-ichi Kawarabayashi
**2-Connected spanning subgraphs with low maximum degree in locally planar graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:3, pp:401-412 [Journal] - Yair Caro, Mark N. Ellingham, J. E. Ramey
**Local Structure When All Maximal Independent Sets Have Equal Weight.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1998, v:11, n:4, pp:644-654 [Journal] - Mark N. Ellingham, Xiaoya Zha, Yi Zhang
**Spanning 2-trails from degree sum conditions.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2004, v:45, n:4, pp:298-319 [Journal] - Mark N. Ellingham
**Isomorphic factorization of r-regular graphs into r parts.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1988, v:69, n:1, pp:19-34 [Journal] - Mark N. Ellingham, Robert L. Hemminger, Kathryn E. Johnson
**Contractible edges in longest cycles in non-Hamiltonian graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:133, n:1-3, pp:89-98 [Journal] - Mark N. Ellingham, D. Christopher Stephens
**The nonorientable genus of joins of complete graphs with large edgeless graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:5, pp:827-845 [Journal] **The orientable genus of some joins of complete graphs with large edgeless graphs.**[Citation Graph (, )][DBLP]
Search in 0.023secs, Finished in 0.024secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |