Map color theorem
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) History of combinatorics (05-03) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph theory (05Cxx) Relations of low-dimensional topology with graph theory (57M15)
Cited in
(only showing first 100 items - show all)- A constraint on the biembedding of Latin squares
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
- The orientable genus of some joins of complete graphs with large edgeless graphs
- Rings whose zero-divisor graphs have positive genus
- Lightness of digraphs in surfaces and directed game chromatic number
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
- Exponentially many maximum genus embeddings and genus embeddings for complete graphs
- Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs
- The directed genus of the de Bruijn graph
- Maps of m-pires on the projective plane
- Uniquely and faithfully embeddable projective-planar triangulations
- Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
- Heawood's empire problem
- Zur Einbettbarkeit von Graphen in den Torus
- The Cartesian product of three triangles can be embedded into a subspace of genus 7
- Nonexistence of weakly neighborly polyhedral maps on the orientable 2- manifold of genus 2
- Combinatorics of orientation reversing polygons
- On weakly neighborly polyhedral maps of arbitrary genus
- The toroidal splitting number of the complete graph \(K_ n\)
- (m)-covering of a triangulation
- The splitting number of the complete graph in the projective plane
- Heawood inequalities
- Minimal quadrangulations of orientable surfaces
- Minimal quadrangulations of nonorientable surfaces
- Genus distributions for two classes of graphs
- Tight and O-tight polyhedral embeddings of surfaces
- An algorithm for imbedding cubic graphs in the torus
- Hadwiger's conjecture for graphs on the Klein bottle
- Geschlossene Flächen im Rand des Würfels
- Dual imbeddings and wrapped quasi-coverings of graphs
- Constructing a covering triangulation by means of a nowhere-zero dual flow
- Neighborly maps with few vertices
- On the number of maximum genus embeddings of almost all graphs
- The medial graph and voltage-current duality
- A new solution for the nonorientable case 1 of the Heawood map color theorem
- Self-dual orientable embedding of K_n
- Some cases of triangular imbeddings for \(K_{n(m)}\)
- Orientable and non orientable genus of the complete bipartite graph
- Orientable imbedding of line-graphs
- A minimum-vertex triangulation
- The genus of the symmetric quadripartite graph
- The genus of \(K_n-K_2\)
- Block designs and graph imbeddings
- Développements recents de la théorie des graphes
- Index four orientable embeddings and case zero of the Heawood conjecture
- Triangular imbedding of \(K_n-K_6\)
- On the genus of the graph \(K_n\times K_2\) or the n-prism
- l-regular rotations of the countably infinite complete graph
- On the chromatic number of skew graphs
- The nonorientable genus of the symmetric quadripartite graph
- How to determine the maximum genus of a graph
- Upper embeddability and connectivity of graphs
- An obstruction to embedding graphs in surfaces
- Hamilton surfaces for the complete even symmetric bipartite graph
- Qualitative theory of foliations on closed surfaces
- Face 2-colourable triangular embeddings of complete graphs
- On the connectivity of graphs embedded in surfaces
- Upper bound theorems for homology manifolds
- Embeddings of graphs
- Maximum and minimum toughness of graphs of small genus
- Peixoto graphs of Morse-Smale foliations on surfaces
- A tighter bounding interval for the 1-chromatic number of a surface
- An infinite series of surfaces with known 1-chromatic number
- A possibly infinite series of surfaces with known 1-chromatic number
- On the genus of joins and compositions of graphs
- Orientable triangular embeddings of K\(_{18}\)-K\(_3\) and K\(_{13}\)-K\(_3\)
- Another proof of the map color theorem for nonorientable surfaces.
- Exponential families of non-isomorphic triangulations of complete graphs
- Bi-embeddings of the projective space PG(3, 2)
- Triangular embeddings of \(K_n-K_m\) with unboundedly large \(m\)
- Lifting graph automorphisms by voltage assignments
- On the planarity of cyclic graphs
- On generalized Heawood inequalities for manifolds: a van Kampen-Flores-type nonembeddability result
- Classes of quantum codes derived from self-dual orientable embeddings of complete multipartite graphs
- A simple construction for orientable triangular embeddings of the complete graphs on 12 s vertices
- Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds
- A note on directed genera of some tournaments
- Construction of a topological drawing of the most planar subgraph of the non-planar graph
- Transportation networks: Old and new
- The splitting number of the complete graph
- Uniqueness and faithfulness of embedding of toroidal graphs
- Connected graphs of genus g with complementary orbits
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- Face covers and the genus problem for apex graphs
- Coloring face-hypergraphs of graphs on surfaces
- Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
- Perfect Clar structures and 3-homogeneous simplicial complexes
- On the bi-embeddability of certain Steiner triple systems of order 15
- The combinatorics of gradient-like flows and foliations on closed surfaces. I: Topological classification
- Nonorientable biembeddings of Steiner triple systems
- Planar triangulations which quadrangulate other surfaces
- Generating cycle spaces for graphs on surfaces with small genera
- A nonorientable triangular embedding of \(K_ n-K_ 2\), \(n\equiv 8\pmod{12}\)
- The genus of a random graph
- Bounds for the average genus of the vertex-amalgamation of graphs
- Permuted difference cycles and triangulated sphere bundles
- Triangulations
- Embedding distributions and Chebyshev polynomials
- Limits for embedding distributions
- On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces
This page was built for publication: Map color theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4773723)