Bemerkungen zum Vierfarbenproblem

zbMath0014.18102MaRDI QIDQ2645092

No author found.

Publication date: 1936

Published in: Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/146109

zbMATH Keywords

Topology

Related Items (75)

Construction of acyclically 4-colourable planar triangulations with minimum degree 4 ⋮ A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs ⋮ Flip graphs of stacked and flag triangulations of the 2-sphere ⋮ Untangling polygons and graphs ⋮ Grid embedding of 4-connected plane graphs ⋮ Drawings of planar graphs with few slopes and segments ⋮ Diagonal transformations of graphs and Dehn twists of surfaces ⋮ On Edge-Length Ratios of Partial 2-Trees ⋮ Primität und Homomorphie von ebenen Dreiecksgraphen ⋮ Representing orders on the plane by translating convex figures ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Planar graphs and poset dimension ⋮ Drawing planar graphs using the canonical ordering ⋮ Algorithms for plane representations of acyclic digraphs ⋮ The non-planarity of \(K_{5}\) and \(K_{3,3}\) as axioms for plane ordered geometry ⋮ Making triangulations 4-connected using flips ⋮ Orthogonal cartograms with at most 12 corners per face ⋮ Upward planar drawings on the standing and the rolling cylinders ⋮ Characterizing and efficiently computing quadrangulations of planar point sets ⋮ Tutte's barycenter method applied to isotopies ⋮ An exponential bound for simultaneous embeddings of planar graphs ⋮ Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs ⋮ The computational complexity of knot genus in a fixed 3‐manifold ⋮ Flip paths between lattice triangulations ⋮ Topological quantum field theory and polynomial identities for graphs on the torus ⋮ Planarity and duality of finite and infinite graphs ⋮ Diagonal flips in plane graphs with triangular and quadrangular faces ⋮ \(N\)-flips in 4-connected even triangulations on the sphere ⋮ Compatible spanning trees in simple drawings of \(K_n\) ⋮ Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs ⋮ A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners ⋮ Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges ⋮ On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2 ⋮ Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints ⋮ Outerplanar graph drawings with few slopes ⋮ Connectivity augmentation in planar straight line graphs ⋮ On flat submaps of maps of nonpositive curvature ⋮ Upward point set embeddings of paths and trees ⋮ A generalization of diagonal flips in a convex polygon ⋮ On local transformations in plane geometric graphs embedded on small grids ⋮ A linear-time algorithm for drawing a planar graph on a grid ⋮ Flipping in spirals ⋮ Flips in planar graphs ⋮ Simultaneous graph embedding with bends and circular arcs ⋮ A lower bound on the diameter of the flip graph ⋮ On the mixing time of the flip walk on triangulations of the sphere ⋮ Efficient enumeration of all ladder lotteries and its application ⋮ Lattices contained in planar orders are planar ⋮ \(N\)-flips in even triangulations on the torus and Dehn twists preserving monodromies ⋮ Drawing planar graphs with circular arcs ⋮ Unnamed Item ⋮ Convex drawings of hierarchical planar graphs and clustered planar graphs ⋮ Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three ⋮ Geometric quadrangulations of a polygon ⋮ Four-Connected Spanning Subgraphs of Doughnut Graphs ⋮ On the crossing number for Kronecker product of a tripartite graph with path ⋮ Polyline drawings with topological constraints ⋮ \(N\)-flips in even triangulations on surfaces ⋮ Drawing slicing graphs with face areas ⋮ Einbettung von Streckenkomplexen in die Ebene ⋮ Vertex unfoldings of tight polyhedra ⋮ Minimum-width grid drawings of plane graphs ⋮ Unnamed Item ⋮ Bemerkungen über ebene Graphen ⋮ Graphs with forbidden subgraphs ⋮ Bemerkungen zu Hadwigers Vermutung ⋮ An algorithm for constructing star-shaped drawings of plane graphs ⋮ Untangling a planar graph ⋮ Diagonal flips in triangulations on closed surfaces with minimum degree at least 4 ⋮ Diagonal flips in Hamiltonian triangulations on the projective plane ⋮ On the number of acute triangles in a straight-line embedding of a maximal planar graph ⋮ Incremental convex planarity testing ⋮ Every triangle-free planar graph has a planar upward drawing ⋮ Regular flip equivalence of surface triangulations ⋮ Planarity-preserving clustering and embedding for large planar graphs

This page was built for publication: Bemerkungen zum Vierfarbenproblem