Mark Ellingham
#50,678
Most Influential Person Now
Mathematician
Mark Ellingham's AcademicInfluence.com Rankings
Mark Ellinghammathematics Degrees
Mathematics
#2652
World Rank
#4059
Historical Rank
#1031
USA Rank
Measure Theory
#5023
World Rank
#5924
Historical Rank
#1413
USA Rank
Download Badge
Mathematics
Mark Ellingham's Degrees
- Masters Mathematics University of Oxford
Why Is Mark Ellingham Influential?
(Suggest an Edit or Addition)According to Wikipedia, Mark Norman Ellingham is a professor of mathematics at Vanderbilt University whose research concerns graph theory. With Joseph D. Horton, he is the discoverer and namesake of the Ellingham–Horton graphs, two cubic 3-vertex-connected bipartite graphs that have no Hamiltonian cycle.
Mark Ellingham's Published Works
Published Works
- List edge colourings of some 1-factorable multigraphs (1996) (70)
- Basic subgraphs and graph spectra (1993) (64)
- The Spectral Radius of Graphs on Surfaces (2000) (63)
- World music : the rough guide (1999) (59)
- Toughness, trees, and walks (2000) (56)
- Local Structure When All Maximal Independent Sets Have Equal Weight (1998) (44)
- A Characterization of Well-covered Cubic Graphs (1993) (37)
- Spanning Planar Subgraphs of Graphs in the Torus and Klein Bottle (1995) (29)
- Non-hamiltonian 3-connected cubic bipartite graphs (1983) (25)
- Connected (g, f)‐factors (2002) (21)
- Selection and characterization of RNA aptamers to the RNA-dependent RNA polymerase from foot-and-mouth disease virus. (2006) (21)
- The Rough Guide to world music. (2006) (19)
- Cycles through ten vertices in 3-connected cubic graphs (1984) (19)
- The nonorientable genus of complete tripartite graphs (2006) (18)
- P 3 -isomorphisms for graphs (1997) (18)
- Spanning Trees in Locally Planar Triangulations (1994) (17)
- The nonorientable genus of joins of complete graphs with large edgeless graphs (2007) (17)
- Bidegreed graphs are edge reconstructible (1987) (16)
- The orientable genus of some joins of complete graphs with large edgeless graphs (2009) (15)
- Prism‐hamiltonicity of triangulations (2008) (14)
- Isomorphic Factorization of Regular Graphs and 3-Regular Multigraphs (1988) (13)
- Connected (g, f)-factors (2002) (12)
- Claw-free graphs are edge reconstructible (1988) (12)
- Vertex-switching reconstruction of subgraph numbers and triangle-free graphs (1992) (11)
- Spanning 2‐trails from degree sum conditions (2004) (10)
- Linkage for the diamond and the path with four vertices (2012) (8)
- Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices (2005) (8)
- A Characterization of K2, 4-Minor-Free Graphs (2014) (8)
- Vertex-switching, isomorphism, and pseudosimilarity (1991) (8)
- Distinguishing partitions and asymmetric uniform hypergraphs (2011) (7)
- Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications (2014) (7)
- World Music - Africa, Europe and the Middle East (1999) (7)
- Colorability of Planar Graphs with Isolated Nontriangular Faces (2004) (7)
- Contractible edges in longest cycles in non-Hamiltonian graphs (1994) (7)
- P3-isomorphisms for graphs (1997) (7)
- Constructing certain cubic graphs (1982) (6)
- Counterexamples to the nonorientable genus conjecture for complete tripartite graphs (2005) (6)
- A characterization of $K_{2,4}$-minor-free graphs (2014) (6)
- 2-Connected spanning subgraphs with low maximum degree in locally planar graphs (2007) (6)
- Isomorphic factorization of r-regular graphs into r parts (1988) (6)
- Isomorphic factorization of regular graphs of even degree (1988) (6)
- Girth, minimum degree, and circumference (2000) (6)
- Spanning Trails with Maximum Degree at Most 4 in $$2K_2$$2K2-Free Graphs (2016) (6)
- Separating Cycles in Doubly Toroidal Embeddings (2003) (5)
- Orientable embeddings and orientable cycle double covers of projective-planar graphs (2009) (5)
- Rock : the rough guide (1996) (4)
- The asymptotic connectivity of labelled coloured regular bipartite graphs (1983) (4)
- Hamiltonicity of planar graphs with a forbidden minor (2016) (4)
- Edge-outer graph embedding and the complexity of the DNA reporter strand problem (2017) (4)
- Nonorientable hamilton cycle embeddings of complete tripartite graphs (2012) (4)
- Prism-hamiltonicity of triangulations (2008) (4)
- The Chvátal-Erdős condition for prism-Hamiltonicity (2018) (4)
- Partial duality and closed 2-cell embeddings (2015) (4)
- The Rough Guide to Morocco (1985) (4)
- Italy, the Rough Guide (1992) (3)
- Vertex-Switching Reconstruction and Folded Cubes (1996) (2)
- Spanning 2-trails from degree sum conditions (2004) (2)
- Quadrangular embeddings of complete graphs (2016) (2)
- Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs I: Latin Square Constructions (2014) (2)
- Morocco: The Rough Guide (1990) (2)
- A characterisation of cubic parity graphs (2003) (2)
- Maximum spectral radius of outerplanar 3‐uniform hypergraphs (2020) (2)
- Tuscany & Umbria : the rough guide (1994) (1)
- Portugal: The Rough Guide (1994) (1)
- A Catalog of Enumeration Formulas for Bouquet and Dipole Embeddings under Symmetries (2022) (1)
- Criticality of Counterexamples to Toroidal Edge-Hamiltonicity (2013) (1)
- Greece : the rough guide (1992) (1)
- The Chv\'atal-Erd\H{o}s condition for prism-Hamiltonicity (2018) (1)
- Minimal quadrangulations of surfaces (2021) (1)
- Cycles in quasi 4-connected graphs (1997) (1)
- Spain: The Rough Guide (1992) (0)
- To Adrian Bondy on his 70th birthday (2015) (0)
- Partial duality for graph embeddings (2013) (0)
- Constructing all minimum genus embeddings of K3, n (2008) (0)
- Criticality of Counterexamples to Toroidal Edge-Hamiltonicity (2015) (0)
- Andalucia : the rough guide (1985) (0)
- One‐way infinite 2‐walks in planar graphs (2015) (0)
- The orientable genus of certain complete tripartite graphs (2003) (0)
- Toughness and spanning trees in K4mf graphs (2019) (0)
This paper list is powered by the following services:
Other Resources About Mark Ellingham
What Schools Are Affiliated With Mark Ellingham?
Mark Ellingham is affiliated with the following schools: