The following pages link to Mark N. Ellingham (Q704850):
Displaying 50 items.
- (Q251508) (redirect page) (← links)
- Nonorientable Hamilton cycle embeddings of complete tripartite graphs (Q427835) (← links)
- Colorability of planar graphs with isolated nontriangular faces (Q704852) (← links)
- Toughness and prism-Hamiltonicity of \(P_4\)-free graphs (Q777381) (← links)
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs (Q875943) (← links)
- Vertex-switching reconstruction of subgraph numbers and triangle-free graphs (Q909676) (← links)
- The orientable genus of some joins of complete graphs with large edgeless graphs (Q1011790) (← links)
- Non-Hamiltonian 3-connected cubic bipartite graphs (Q1052335) (← links)
- Spanning trees in locally planar triangulations (Q1333338) (← links)
- Contractible edges in longest cycles in non-Hamiltonian graphs (Q1336689) (← links)
- Separating cycles in doubly toroidal embeddings (Q1401553) (← links)
- The spectral radius of graphs on surfaces (Q1569068) (← links)
- Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs (Q1684926) (← links)
- Counterexamples to the nonorientable genus conjecture for complete tripartite graphs (Q1767627) (← links)
- Isomorphic factorization of r-regular graphs into r parts (Q1825883) (← links)
- Spanning planar subgraphs of graphs in the torus and Klein bottle (Q1898728) (← links)
- Vertex-switching reconstruction and folded cubes (Q1924133) (← links)
- Minimal quadrangulations of surfaces (Q2171020) (← links)
- The Chvátal-Erdős condition for prism-Hamiltonicity (Q2182179) (← links)
- Cycles through ten vertices in 3-connected cubic graphs (Q2266024) (← links)
- Edge-outer graph embedding and the complexity of the DNA reporter strand problem (Q2315018) (← links)
- Quadrangular embeddings of complete graphs and the even map color theorem (Q2338632) (← links)
- Partial duality and closed 2-cell embeddings (Q2364861) (← links)
- Orientable embeddings and orientable cycle double covers of projective-planar graphs (Q2430969) (← links)
- The nonorientable genus of complete tripartite graphs (Q2496204) (← links)
- List edge colourings of some 1-factorable multigraphs (Q2563511) (← links)
- The nonorientable genus of joins of complete graphs with large edgeless graphs (Q2642016) (← links)
- Connected (g, f)-factors (Q2778283) (← links)
- A Characterization of $K_{2,4}$-Minor-Free Graphs (Q2808156) (← links)
- Linkage for the diamond and the path with four vertices (Q2897205) (← links)
- Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications (Q2930039) (← links)
- (Q3043187) (← links)
- Distinguishing partitions and asymmetric uniform hypergraphs (Q3119062) (← links)
- (Q3222878) (← links)
- (Q3383468) (← links)
- (Q3720617) (← links)
- (Q3743321) (← links)
- Bidegreed graphs are edge reconstructible (Q3809831) (← links)
- (Q3818357) (← links)
- (Q3826608) (← links)
- (Q3949082) (← links)
- Vertex-switching, isomorphism, and pseudosimilarity (Q3984465) (← links)
- (Q4201585) (← links)
- Local Structure When All Maximal Independent Sets Have Equal Weight (Q4210230) (← links)
- (Q4286076) (← links)
- (Q4349610) (← links)
- P3-isomorphisms for graphs (Q4355070) (← links)
- (Q4390602) (← links)
- (Q4432949) (← links)
- Spanning 2‐trails from degree sum conditions (Q4459608) (← links)
