default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark N. Ellingham
Person information
- affiliation: Vanderbilt University, Department of Mathematics, Nashville, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j49]Wenzhong Liu, Mark N. Ellingham
, Dong Ye:
Minimal quadrangulations of surfaces. J. Comb. Theory B 157: 235-262 (2022)- [j48]Mark N. Ellingham, Linyuan Lu, Zhiyu Wang:
Maximum spectral radius of outerplanar 3-uniform hypergraphs. J. Graph Theory 100(4): 671-685 (2022) - [j47]Mark N. Ellingham, Joanna A. Ellis-Monaghan:
A Catalog of Enumeration Formulas for Bouquet and Dipole Embeddings under Symmetries. Symmetry 14(9): 1793 (2022) - 2021
- [j46]Mark N. Ellingham, Songling Shan, Dong Ye, Xiaoya Zha:
Toughness and spanning trees in K4-minor-free graphs. J. Graph Theory 96(3): 379-402 (2021) - 2020
- [j45]Mark N. Ellingham, Pouria Salehi Nowbandegani, Songling Shan:
Toughness and prism-hamiltonicity of P4-free graphs. Discret. Appl. Math. 284: 201-206 (2020) - [j44]Mark N. Ellingham, Pouria Salehi Nowbandegani:
The Chvátal-Erdős condition for prism-Hamiltonicity. Discret. Math. 343(7): 111709 (2020)
2010 – 2019
- 2019
- [j43]Wenzhong Liu, Serge Lawrencenko, Beifang Chen, Mark N. Ellingham, Nora Hartsfield, Hui Yang, Dong Ye, Xiaoya Zha:
Quadrangular embeddings of complete graphs and the Even Map Color Theorem. J. Comb. Theory B 139: 1-26 (2019) - [j42]Mark N. Ellingham, Emily Abernethy Marshall, Kenta Ozeki, Shoichi Tsuchiya:
Hamiltonicity of planar graphs with a forbidden minor. J. Graph Theory 90(4): 459-483 (2019) - [j41]Mark N. Ellingham, Joanna A. Ellis-Monaghan:
Edge-outer graph embedding and the complexity of the DNA reporter strand problem. Theor. Comput. Sci. 785: 117-127 (2019) - 2018
- [j40]Daniel P. Biebighauser, Mark N. Ellingham:
One-way infinite 2-walks in planar graphs. J. Graph Theory 88(1): 110-130 (2018) - 2017
- [j39]Guantao Chen, Mark N. Ellingham, Akira Saito, Songling Shan:
Spanning Trails with Maximum Degree at Most 4 in 2K2 -Free Graphs. Graphs Comb. 33(5): 1095-1101 (2017) - 2016
- [j38]Mark N. Ellingham, Emily Abernethy Marshall:
Criticality of Counterexamples to Toroidal Edge-Hamiltonicity. Graphs Comb. 32(1): 111-121 (2016) - [j37]Mark N. Ellingham, Emily Abernethy Marshall, Kenta Ozeki, Shoichi Tsuchiya:
A Characterization of K2, 4-Minor-Free Graphs. SIAM J. Discret. Math. 30(2): 955-975 (2016) - 2014
- [j36]Mark N. Ellingham, Justin Z. Schroeder:
Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications. J. Graph Theory 77(3): 219-236 (2014) - 2012
- [j35]Mark N. Ellingham, Justin Z. Schroeder:
Nonorientable hamilton cycle embeddings of complete tripartite graphs. Discret. Math. 312(11): 1911-1917 (2012) - [j34]Mark N. Ellingham, Michael D. Plummer, Gexin Yu:
Linkage for the diamond and the path with four vertices. J. Graph Theory 70(3): 241-261 (2012) - 2011
- [j33]Mark N. Ellingham, Justin Z. Schroeder:
Distinguishing partitions and asymmetric uniform hypergraphs. Ars Math. Contemp. 4(1): 111-123 (2011) - [j32]Mark N. Ellingham, Xiaoya Zha:
Orientable embeddings and orientable cycle double covers of projective-planar graphs. Eur. J. Comb. 32(4): 495-509 (2011)
2000 – 2009
- 2009
- [j31]Mark N. Ellingham, D. Christopher Stephens:
The orientable genus of some joins of complete graphs with large edgeless graphs. Discret. Math. 309(5): 1190-1198 (2009) - 2008
- [j30]Mark N. Ellingham, Adam Weaver:
Constructing all minimum genus embeddings of K3, n. Electron. Notes Discret. Math. 31: 293-298 (2008) - [j29]Daniel P. Biebighauser, Mark N. Ellingham:
Prism-hamiltonicity of triangulations. J. Graph Theory 57(3): 181-197 (2008) - 2007
- [j28]Mark N. Ellingham, Ken-ichi Kawarabayashi:
2-Connected spanning subgraphs with low maximum degree in locally planar graphs. J. Comb. Theory B 97(3): 401-412 (2007) - [j27]Mark N. Ellingham, D. Christopher Stephens:
The nonorientable genus of joins of complete graphs with large edgeless graphs. J. Comb. Theory B 97(5): 827-845 (2007) - 2006
- [j26]Mark N. Ellingham, Chris Stephens, Xiaoya Zha:
The nonorientable genus of complete tripartite graphs. J. Comb. Theory B 96(4): 529-559 (2006) - 2005
- [j25]Mark N. Ellingham, Chris Stephens, Xiaoya Zha:
Counterexamples to the nonorientable genus conjecture for complete tripartite graphs. Eur. J. Comb. 26(3-4): 387-399 (2005) - 2004
- [j24]Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger:
Colorability of Planar Graphs with Isolated Nontriangular Faces. Graphs Comb. 20(4): 443-446 (2004) - [j23]Mark N. Ellingham, Xiaoya Zha, Yi Zhang:
Spanning 2-trails from degree sum conditions. J. Graph Theory 45(4): 298-319 (2004) - 2003
- [j22]Rommel M. Barbosa, Mark N. Ellingham:
A characterisation of cubic parity graphs. Australas. J Comb. 28: 273-294 (2003) - [j21]Mark N. Ellingham, Xiaoya Zha:
Separating Cycles in Doubly Toroidal Embeddings. Graphs Comb. 19(2): 161-175 (2003) - 2002
- [j20]Mark N. Ellingham, Yunsun Nam, Heinz-Jürgen Voss:
Connected (g, f)-factors. J. Graph Theory 39(1): 62-75 (2002) - 2000
- [j19]Mark N. Ellingham, Xiaoya Zha:
The Spectral Radius of Graphs on Surfaces. J. Comb. Theory B 78(1): 45-56 (2000) - [j18]Mark N. Ellingham, Xiaoya Zha:
Toughness, trees, and walks. J. Graph Theory 33(3): 125-137 (2000) - [j17]Mark N. Ellingham, D. K. Menser:
Girth, minimum degree, and circumference. J. Graph Theory 34(3): 221-233 (2000)
1990 – 1999
- 1998
- [j16]Yair Caro, Mark N. Ellingham, J. E. Ramey:
Local Structure When All Maximal Independent Sets Have Equal Weight. SIAM J. Discret. Math. 11(4): 644-654 (1998) - 1997
- [j15]Robert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Derek A. Holton:
Cycles in quasi 4-connected graphs. Australas. J Comb. 15: 37-46 (1997) - [j14]Robert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Peter Jipsen:
P3-isomorphisms for graphs. J. Graph Theory 26(1): 35-51 (1997) - 1996
- [j13]Mark N. Ellingham, Luis A. Goddyn:
List Edge Colourings of Some 1-Factorable Multigraphs. Comb. 16(3): 343-352 (1996) - [j12]Mark N. Ellingham:
Vertex-Switching Reconstruction and Folded Cubes. J. Comb. Theory B 66(2): 361-364 (1996) - 1995
- [j11]Richard Brunet, Mark N. Ellingham, Zhicheng Gao, Alice Metzlar, R. Bruce Richter:
Spanning Planar Subgraphs of Graphs in the Torus and Klein Bottle. J. Comb. Theory B 65(1): 7-22 (1995) - 1994
- [j10]Mark N. Ellingham, Robert L. Hemminger, Kathryn E. Johnson:
Contractible edges in longest cycles in non-Hamiltonian graphs. Discret. Math. 133(1-3): 89-98 (1994) - [j9]Mark N. Ellingham, Zhicheng Gao:
Spanning Trees in Locally Planar Triangulations. J. Comb. Theory B 61(2): 178-198 (1994) - 1993
- [j8]Mark N. Ellingham:
Basic subgraphs and graph spectra. Australas. J Comb. 8: 247-266 (1993) - 1992
- [j7]Mark N. Ellingham, Gordon F. Royle:
Vertex-switching reconstruction of subgraph numbers and triangle-free graphs. J. Comb. Theory B 54(2): 167-177 (1992) - 1991
- [j6]Mark N. Ellingham:
Vertex-switching, isomorphism, and pseudosimilarity. J. Graph Theory 15(6): 563-572 (1991)
1980 – 1989
- 1988
- [j5]Mark N. Ellingham:
Isomorphic factorization of r-regular graphs into r parts. Discret. Math. 69(1): 19-34 (1988) - [j4]Mark N. Ellingham, László Pyber, Xingxing Yu:
Claw-free graphs are edge reconstructible. J. Graph Theory 12(3): 445-451 (1988) - 1987
- [j3]Wendy J. Myrvold, Mark N. Ellingham, D. G. Hoffman:
Bidegreed graphs are edge reconstructible. J. Graph Theory 11(3): 281-302 (1987) - 1984
- [j2]Mark N. Ellingham, Derek A. Holton, Charles H. C. Little:
Cycles through ten vertices in 3-connected cubic graphs. Comb. 4(4): 265-273 (1984) - 1983
- [j1]Mark N. Ellingham, Joseph Douglas Horton:
Non-hamiltonian 3-connected cubic bipartite graphs. J. Comb. Theory B 34(3): 350-353 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
