The nonorientable genus of joins of complete graphs with large edgeless graphs
From MaRDI portal
Publication:2642016
DOI10.1016/J.JCTB.2007.02.001zbMATH Open1122.05028OpenAlexW2060395153MaRDI QIDQ2642016FDOQ2642016
M. N. Ellingham, D. Christopher Stephens
Publication date: 20 August 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.02.001
Recommendations
- The nonorientable genus of the join of two cycles
- The orientable genus of some joins of complete graphs with large edgeless graphs
- The orientable genus of the join of a cycle and a complete graph
- Genus of \(C_{m,n}\) and strong genus embedding of \(K_{m,n}\)
- Nonorientable genus of nearly complete bipartite graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Graphs on surfaces
- Title not available (Why is that?)
- Orientable and non orientable genus of the complete bipartite graph
- Title not available (Why is that?)
- Minimal triangulations on orientable surfaces
- Title not available (Why is that?)
- The nonorientable genus of complete tripartite graphs
- Der vollständige paare Graph auf nichtorientierbaren Flächen.
- Title not available (Why is that?)
- The orientable genus of some joins of complete graphs with large edgeless graphs
- Title not available (Why is that?)
- Minimal ordered triangulations of surfaces
- Orientable and Nonorientable Genera for Some Complete Tripartite Graphs
- Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen
- Orientable triangular embeddings of K\(_{18}\)-K\(_3\) and K\(_{13}\)-K\(_3\)
- Another proof of the map color theorem for nonorientable surfaces.
- On the genus of joins and compositions of graphs
- Determination of regular embeddings of graphs on surfaces
- Triangular embeddings of \(K_n-K_m\) with unboundedly large \(m\)
- Counterexamples to the nonorientable genus conjecture for complete tripartite graphs
- The genus of \(K_n-K_2\)
- Triangular imbedding of \(K_n-K_6\)
- A smooth and unified proof of cases 6, 5 and 3 of the Ringel-Youngs theorem
- A nonorientable triangular embedding of \(K_ n-K_ 2\), \(n\equiv 8\pmod{12}\)
Cited In (21)
- Biembedding a Steiner triple system with a Hamilton cycle decomposition of a complete graph
- Biembeddings of symmetric \(n\)-cycle systems
- Doubly even orientable closed 2-cell embeddings of the complete graph
- Coloring vertices and faces of maps on surfaces
- Nonorientable Hamilton cycle embeddings of complete tripartite graphs
- The orientable genus of the join of a cycle and a complete graph
- The orientable genus of some joins of complete graphs with large edgeless graphs
- On the genus of joins and compositions of graphs
- The nonorientable genus of complete tripartite graphs
- Counterexamples to the nonorientable genus conjecture for complete tripartite graphs
- Nonorientable genus of nearly complete bipartite graphs
- Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs
- Face 2-Colorable Embeddings with Faces of Specified Lengths
- On the orientable genus of graphs with bounded nonorientable genus
- Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs I: Latin Square Constructions
- Settling the nonorientable genus of the nearly complete bipartite graphs
- Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness
- Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications
- The nonorientable genus of the join of two cycles
- On the non-orientable genus of a 2-connected graph
- Nilpotent graphs with crosscap at most two
This page was built for publication: The nonorientable genus of joins of complete graphs with large edgeless graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642016)
