scientific article; zbMATH DE number 2109336

From MaRDI portal
Publication:4821954

zbMath1051.05036MaRDI QIDQ4821954

Stefan Felsner

Publication date: 22 October 2004


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (41)

On degree sequences and eccentricities in pseudoline arrangement graphsThe Kashaev equation and related recurrencesGreedy drawings of triangulationsMax point-tolerance graphsOrder distances and split systemsOn inducing polygons and related problemsConvex grid drawings of planar graphs with constant edge-vertex resolutionTukey depth histogramsA note on light geometric graphsUpper and Lower Bounds on Long Dual Paths in Line ArrangementsImproved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphsWhen Can Splits be Drawn in the Plane?A pseudoline counterexample to the strong Dirac conjectureSphere and dot product representations of graphsStrictly-convex drawings of 3-connected planar graphsThe geometry of chaotic dynamics --- a complex network perspectiveOn the Number of α-OrientationsOn arrangements of orthogonal circlesTriangle contact representations and dualityCoding and counting arrangements of pseudolinesToroidal maps: Schnyder woods, orthogonal surfaces and straight-line representationsOrthogonal surfaces and their CP-ordersGrid drawings of graphs with constant edge-vertex resolutionRoot bundles and towards exact matter spectra of F-theory MSSMsOn smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawingsSchnyder woods and orthogonal surfacesOn convex geometric graphs with no \(k+1\) pairwise disjoint edgesA note on the weak Dirac conjectureDisjoint edges in geometric graphsOn the affine Sylvester problemThere are not too many magic configurationsCrossing numbers and combinatorial characterization of monotone drawings of \(K_n\)Adjacency posets of planar graphsColoring copoints of a planar point setConvex grid drawings of planar graphs with constant edge-vertex resolutionConnections between Theta-Graphs, Delaunay Triangulations, and Orthogonal SurfacesOptimal algorithms for computing edge weights in planar split networksSampling and Counting 3-Orientations of Planar TriangulationsMusings on an example of Danzer'sArrangements of pseudocircles and circlesBijective counting of plane bipolar orientations and Schnyder woods




This page was built for publication: