scientific article

From MaRDI portal
Publication:2726740

zbMath0979.05002MaRDI QIDQ2726740

Bojan Mohar, Carsten Thomassen

Publication date: 18 July 2001


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



Related Items

Minimum Cuts in Surface Graphs, Classes of graphs embeddable in order-dependent surfaces, Clustered 3-colouring graphs of bounded degree, New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs, Subgraph densities in a surface, Tree densities in sparse graph classes, Finitizable set of reductions for polyhedral quadrangulations of closed surfaces, The Sierpiński product of graphs, Self-dual polyhedra of given degree sequence, A bijection for covered maps on orientable surfaces, Six-Critical Graphs on the Klein Bottle, On the genus of non-zero component union graphs of vector spaces, Z-oriented triangulations of surfaces, Robust Connectivity of Graphs on Surfaces, Random 2-cell embeddings of multistars, Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators, Partial-dual Euler-genus distributions for bouquets with small Euler genus, A-trails of embedded graphs and twisted duals, Enumerating graph embeddings and partial-duals by genus and Euler genus, Improved product structure for graphs on surfaces, On local operations that preserve symmetries and on preserving polyhedrality of maps, The projective 3-annihilating-ideal hypergraphs, On the genus of extended zero-divisor graph of commutative rings, Edge‐maximal graphs on orientable and some nonorientable surfaces, Partial-dual polynomials and signed intersection graphs, Combing a Linkage in an Annulus, From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals, Independence numbers of polyhedral graphs, On the hull number on cycle convexity of graphs, The connectivity of the dual, Expected number of faces in a random embedding of any graph is at most linear, All 2-planar graphs having the same spanning subgraph, On a New Extension of Annihilating-Ideal Graph of Commutative Rings, Crosscap two of class of graphs from commutative rings, Weak Heffter arrays and biembedding graphs on non-orientable surfaces, A full characterization of invariant embeddability of unimodular planar graphs, Constructing generalized Heffter arrays via near alternating sign matrices, Branchwidth is \((1, g)\)-self-dual, Shallow Minors, Graph Products, and Beyond-Planar Graphs, Morsifications and mutations, Approximating maximum integral multiflows on bounded genus graphs, Excluded minors for the Klein bottle. I: Low connectivity case, Deciding whether four perfect matchings can cover the edges of a snark is NP-complete, The crossing number of the generalized Petersen graph P(3k,k) in the projective plane, Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality, Graph product structure for non-minor-closed classes, Algorithms for contractibility of compressed curves on 3-manifold boundaries, Excluded minors for the Klein bottle. II: Cascades, Generalized Heawood numbers, A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups, Homomorphisms between graphs embedded in surfaces, Gluing Karcher-Scherk saddle towers. I: Triply periodic minimal surfaces, Embeddings of \(k\)-complexes into \(2k\)-manifolds, On the Diameter of Random Planar Graphs, Unnamed Item, Unnamed Item, Unnamed Item, Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds, On the generalised colouring numbers of graphs that exclude a fixed minor, Unnamed Item, The Genus of a Random Bipartite Graph, Coloring Triangle-Free Graphs on Surfaces, Approximating the Crossing Number of Toroidal Graphs, Unnamed Item, On the generalised colouring numbers of graphs that exclude a fixed minor, Bounding the Cop Number of a Graph by Its Genus, Islands in Graphs on Surfaces, Unnamed Item, Unnamed Item, Unnamed Item, Hanani-Tutte for approximating maps of graphs, Structure and generation of crossing-critical graphs, The $\mathbb{Z}_2$-genus of Kuratowski minors, Unnamed Item, Orientations of infinite graphs with prescribed edge-connectivity, General lower bounds for the minor crossing number of graphs, Inequivalent factorizations of permutations, Finding shorter cycles in a weighted graph, Coloring-flow duality of embedded graphs, Unnamed Item, The orientable genus of the join of a cycle and a complete graph, Extremal embedded graphs, Tracing compressed curves in triangulated surfaces, Diagrammatics of the quartic O(N)3-invariant Sachdev-Ye-Kitaev-like tensor model, Extension to 3-Colorable Triangulations, Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces, Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs, Dynamic programming for graphs on surfaces, Some Conjectures and Questions in Chromatic Topological Graph Theory, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, A note on subspace sum graph of vector spaces, Topological Entropy of Surface Braids and Maximally Efficient Mixing, The Degenerate Crossing Number and Higher-Genus Embeddings, Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus, A robust generalization of the Legendre transform for QFT, Checkerboard colourable twuals, On 2-factors splitting an embedded graph into two plane graphs, Absolute Lipschitz extendability, Crossing number, pair-crossing number, and expansion, A theorem on paths in locally planar triangulations, Embedding grids in surfaces, Extending precolorings of subgraphs of locally planar graphs, Minor-minimal 6-regular graphs in the Klein bottle, Decidability of string graphs, Complete graph drawings up to triangle mutations, Fashion game on planar graphs, Non-zero sum Heffter arrays and their applications, An improved planar graph product structure theorem, Multiple scaling limits of \(\mathrm{U} (N)^2 \times \mathrm{O} (D)\) multi-matrix models, The \(\mathbb{Z}_2\)-genus of Kuratowski minors, The domination number of plane triangulations, The minimum number of edges in 4-critical digraphs of given order, Partially broken orientations of Eulerian plane graphs, Straight-line representations of maps on the torus and other flat surfaces, Embedding distributions and Chebyshev polynomials, Coloring Eulerian triangulations of the Klein bottle, Online graph exploration: New results on old and new algorithms, Locally Hamiltonian graphs and minimal size of maximal graphs on a surface, On the excluded minor structure theorem for graphs of large tree-width, Limits of random tree-like discrete structures, Embeddability of arrangements of pseudocircles and graphs on surfaces, Approximation algorithms via contraction decomposition, Independent sets in Line of Sight networks, Constructing planar support for non-piercing regions, Lattices, graphs, and Conway mutation, On the cyclic coloring conjecture, A survey on the cyclic coloring and its relaxations, Cycle traversability for claw-free graphs and polyhedral maps, Tutte's dichromate for signed graphs, Convex lattice polygons with all lattice points visible, 3-list-coloring graphs of girth at least five on surfaces, Topologically trivial closed walks in directed surface graphs, Characterization of regular checkerboard colourable twisted duals of ribbon graphs, A Tutte polynomial for maps. II: The non-orientable case, Conjugacy and dynamics in Thompson's groups., The (\(n\), \(k\))-extendable graphs in surfaces, The cycle structure for directed graphs on surfaces, Embedding of circulant graphs and generalized Petersen graphs on projective plane, The Dirichlet problem for orthodiagonal maps, Newton flows for elliptic functions III \& IV. Newton flows for elliptic functions III \& IV, pseudo Newton graphs: bifurcation and creation of flows, Antiparallel \(d\)-stable traces and a stronger version of ore problem, Contraction obstructions for treewidth, Characterizations of bipartite and Eulerian partial duals of ribbon graphs, Game edge-connectivity of graphs, Polynomial degeneracy for the first \(m\) energy levels of the antiferromagnetic Ising model, Cycles in 5-connected triangulations, Toroidal grid minors and stretch in embedded graphs, The genus of complete 3-uniform hypergraphs, Factorizing regular graphs, Exponentially many \(\mathbb{Z}_5\)-colorings in simple planar graphs, Planar graphs having no proper 2-immersions in the plane. II, Planar graphs having no proper 2-immersions in the plane. I, Planar graphs having no proper 2-immersions in the plane. III, Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs, Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs, Maps of unfixed genus and blossoming trees, \(z\)-knotted triangulations of surfaces, On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces, Nonseparating independent sets of Cartesian product graphs, Bounding the number of non-duplicates of the \(q\)-side in simple drawings of \(K_{p,q}\), Notes on graph product structure theory, The crossing number of hexagonal graph \(H_{3,n }\) in the projective plane, Balanced polychromatic 2-coloring of triangulations, A lower bound on the tree-width of graphs with irrelevant vertices, On two types of \(Z\)-monodromy in triangulations of surfaces, Edge-outer graph embedding and the complexity of the DNA reporter strand problem, Iterated foldings of discrete spaces and their limits: candidates for the role of Brownian map in higher dimensions, Deleting vertices to graphs of bounded genus, Halin's theorem for cubic graphs on an annulus, Straight-ahead walks in Eulerian graphs, A new large \(N\) expansion for general matrix-tensor models, Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\), Local certification of graphs on surfaces, Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs, Tile-transitive tilings of the Euclidean and hyperbolic planes by ribbons, Link mutations and Goeritz matrices, Topological inductive constructions for tight surface graphs, A survey on genus of selected graphs from commutative rings, Distributed coloring in sparse graphs with fewer colors, Tight cycle spectrum gaps of cubic 3-connected toroidal graphs, Simplicial volume of one-relator groups and stable commutator length, Face covers and the genus problem for apex graphs, Flexibility of polyhedral embeddings of graphs in surfaces, Labeled \(K_{2,t}\) minors in plane graphs, Coloring locally bipartite graphs on surfaces., Coloring face-hypergraphs of graphs on surfaces, Long cycles in graphs on a fixed surface, Genus and book thickness of the inclusion ideal graph of a ring, Heffter arrays and biembedding graphs on surfaces, Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles, 4-connected projective-planar graphs are Hamiltonian-connected, Nonorientable genera of Petersen powers, Local certification of graphs with bounded genus, Exponentially many genus embeddings of the complete graph \(K_{12s+3}\), Extended formulations for stable set polytopes of graphs without two disjoint odd cycles, On the maximum order of graphs embedded in surfaces, The cycle's structure of embedded graphs in surfaces, \((1, j)\)-set problem in graphs, Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations, A class of zero divisor rings in which every graph is precisely the union of a complete graph and a complete bipartite graph, Bounded face-width forces \(K_7\)-minors in orientable surfaces, Obstructions for two-vertex alternating embeddings of graphs in surfaces, Flexibility of projective-planar embeddings, The number of colorings of planar graphs with no separating triangles, Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface, Computing the shortest essential cycle, An Eberhard-like theorem for pentagons and heptagons, Drawing disconnected graphs on the Klein bottle, Rigidity and separation indices of graphs in surfaces, \(K_{6}\)-minors in triangulations on the nonorientable surface of genus 3, 20 years of Negami's planar cover conjecture, Recovering quantum graphs from their Bloch spectrum, The nonorientable genus of the join of two cycles, The empire problem in even embeddings on closed surfaces with \(\varepsilon\leq 0\), The projective plane crossing numbers of circular graphs, Upward planar drawings on the standing and the rolling cylinders, Classification of commutative zero-divisor semigroup graphs, Bijections and symmetries for the factorizations of the long cycle, \(L(p,q)\)-labeling of a graph embeddable on the torus, Graph factors modulo \(k\), Total embedding distributions of Ringel ladders, On self-duality of branchwidth in graphs of bounded genus, The Erdős-Pósa property for clique minors in highly connected graphs, The weak 3-flow conjecture and the weak circular flow conjecture, A note on disjoint cycles, A linear time algorithm for the induced disjoint paths problem in planar graphs, Algorithms for the edge-width of an embedded graph, Linkless and flat embeddings in 3-space, A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs, Large non-planar graphs and an application to crossing-critical graphs, Errors in graph embedding algorithms, Small minors in dense graphs, Nonorientable Hamilton cycle embeddings of complete tripartite graphs, Classifying simple closed curve pairs in the 2-sphere and a generalization of the Schoenflies theorem, Contracting planar graphs to contractions of triangulations, Space complexity of perfect matching in bounded genus bipartite graphs, Catalan structures and dynamic programming in \(H\)-minor-free graphs, On the restricted matching extension of graphs on the torus and the Klein bottle, From the plane to higher surfaces, An improved upper bound for the bondage number of graphs on surfaces, Genus distribution of \(P_3 \mathop\square P_n\), On the maximum number of cliques in a graph embedded in a surface, Subexponential parameterized algorithms, Locally constrained graph homomorphisms -- structure, complexity, and applications, Faster parameterized algorithms for minor containment, Unexpected behaviour of crossing sequences, An analogue of the Harer-Zagier formula for unicellular maps on general surfaces, Spanning closed walks and TSP in 3-connected planar graphs, Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra, Parameterizing cut sets in a graph by the number of their components, Algorithms for finding an induced cycle in planar graphs, On planarity of compact, locally connected, metric spaces, Counting and sampling minimum cuts in genus \(g\) graphs, Nonplanar graphs derived from Gauss codes of virtual knots and links, Strongly 2-connected orientations of graphs, Spanners in sparse graphs, Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs, 2-cell embeddings with prescribed face lengths and genus, Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\), Enumerating simplicial decompositions of surfaces with boundaries, Degenerate and star colorings of graphs on surfaces, Topological minors in line graphs -- a proof of Zha's conjecture, Steiner triple systems, pinched surfaces, and complete multigraphs, The largest demigenus over all signatures on \(K_{3,n}\), Face-width of Pfaffian braces and polyhex graphs on surfaces, Boxicity, poset dimension, and excluded minors, Finding a shortest cycle in a subspace of the cycle space of a graph, The degree-diameter problem for sparse graph classes, The transition matroid of a 4-regular graph: an introduction, Boxicity and topological invariants, Every graph is a cut locus, Bollobás-Riordan and relative Tutte polynomials, Hyperbolic analogues of fullerenes with face-types (6, 9) and (6, 10), Spanning trees with nonseparating paths, Some triangulated surfaces without balanced splitting, Cubic bridgeless graphs and braces, Crosscap of the non-cyclic graph of groups, A bijection for rooted maps on general surfaces, Generating maps on surfaces, Long induced paths in graphs, MSOL restricted contractibility to planar graphs, Box representations of embedded graphs, Survey article: consequences of some outerplanarity extensions, A bijection for covered maps, or a shortcut between Harer-Zagiers and Jacksons formulas, Crossing numbers of graphs with rotation systems, Crossing number and weighted crossing number of near-planar graphs, Embedding 3-manifolds with boundary into closed 3-manifolds, Coloring face hypergraphs on surfaces, Counting unicellular maps on non-orientable surfaces, Some remarks on Hajós' conjecture, A characterization of regular embeddings of \(n\)-dimensional cubes, Rank-width and tree-width of \(H\)-minor-free graphs, What is on his mind?, Strong embeddings of minimum genus, The complexity of separating points in the plane, Grinberg's criterion, Length bounds for cycle bases of graphs, Schnyder woods for higher genus triangulated surfaces, with applications to encoding, Chromatic numbers of exact distance graphs, More on the new large \(D\) limit of matrix models, Cops and robbers on intersection graphs, Short cycle structures for graphs on surfaces and an open problem of Mohar and Thomassen, On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability, Chords of longest circuits in locally planar graphs, Coloring vertices and faces of locally planar graphs, The number of \(k\)-colorings of a graph on a fixed surface, A simpler proof of the excluded minor theorem for higher surfaces, Graphs of polyhedra; polyhedra as graphs, The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces, Classes of cycle bases, Apex graphs with embeddings of face-width three, Many 3-colorings of triangle-free planar graphs, 2-connected spanning subgraphs with low maximum degree in locally planar graphs, Some recent progress and applications in graph minor theory, Hamiltonian cycles in polyhedral maps, Contractions of 6-connected toroidal graphs, Exponentially many 5-list-colorings of planar graphs, The square of a planar cubic graph is 7-colorable, Newton flows for elliptic functions. II: Structural stability: classification and representation, Genus ranges of 4-regular rigid vertex graphs, Spanning quadrangulations of triangulated surfaces, Shortest path embeddings of graphs on surfaces, A Tutte polynomial for non-orientable maps, The smallest surface that contains all signed graphs on \(K_{4, n}\), Decomposing plane cubic graphs, Interdiction problems on planar graphs, Blocking nonorientability of a surface, The chromatic number of a graph of girth 5 on a fixed surface, A large set of torus obstructions and how they were discovered, Cubic graphs and related triangulations on orientable surfaces, Fano plane's embeddings on compact orientable surfaces, Cubic inflation, mirror graphs, regular maps, and partial cubes, Pentagonal maps on the torus and the plane, Random graphs on surfaces, Splitting (complicated) surfaces is hard, Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey, Thickness and outerthickness for embedded graphs, Logical limit laws for minor-closed classes of graphs, Coloring even-faced graphs in the torus and the Klein bottle, Short cycle structure of graphs on surfaces. I: The uniqueness theorems, Generating even triangulations on the torus, Locally planar graphs are 5-choosable, 2-list-coloring planar graphs without monochromatic triangles, Fast minor testing in planar graphs, Parameterized complexity of the spanning tree congestion problem, Induced disjoint paths problem in a planar digraph, 2-restricted extensions of partial embeddings of graphs, Counterexamples to the nonorientable genus conjecture for complete tripartite graphs, Acyclic colorings of locally planar graphs, Irreducible triangulations are small, A simple algorithm for 4-coloring 3-colorable planar graphs, The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees, Extending Lipschitz functions via random metric partitions, Perfect matchings with restricted intersection in cubic graphs, Finding short cycles in embedded graph in polynomial time, A note on traversing specified vertices in graphs embedded with large representativity, Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\), On the restricted matching extension of graphs in surfaces, Critically paintable, choosable or colorable graphs, Five-coloring graphs on the Klein bottle, Markov bases of binary graph models of \(K_{4}\)-minor free graphs, A note on directed genera of some tournaments, A new combinatorial identity for unicellular maps, via a direct bijective approach, Randomly removing \(g\) handles at once, Excluding a large theta graph, On the genus of the complete tripartite graph \(K_{n, n, 1}\), A characterization of planar partial cubes, \(N\)-flips in even triangulations on the projective plane, Planar and grid graph reachability problems, 2-extendability of toroidal polyhexes and Klein-bottle polyhexes, MacLane's theorem for arbitrary surfaces, Generalized thrackle drawings of non-bipartite graphs, Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture, Covering nearly surface-embedded graphs with a fixed number of balls, Constructions of large graphs on surfaces, On the upward embedding on the torus, The orientable genus of some joins of complete graphs with large edgeless graphs, A simpler proof for the two disjoint odd cycles theorem, Degenerate crossing numbers, The enumeration of planar graphs via Wick's theorem, Linear connectivity forces large complete bipartite minors, Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial, Decomposing a planar graph of girth 5 into an independent set and a forest, Numbers of faces in disordered patches, Optimized algorithm to find all symmetry-distinct maps of a graph: Application to topology-driven molecular design, The monadic second-order logic of graphs. XII: Planar graphs and planar maps, Edge-decompositions of highly connected graphs into paths, Quadrangulations and 4-color-critical graphs, Removing even crossings on surfaces, Indecomposable permutations, hypermaps and labeled Dyck paths, New bijective links on planar maps via orientations, Bounding the size of equimatchable graphs of fixed genus, Fundamental cycles and graph embeddings, Excluding a countable clique, Convex representations of maps on the torus and other flat surfaces, Twisted duality for embedded graphs, Circle packings of maps —The Euclidean case, Semi-dynamic Connectivity in the Plane, Extension to Even Triangulations, Book embedding of locally planar graphs on orientable surfaces, Untangling two systems of noncrossing curves, A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface, Boxicity of graphs on surfaces, Combinatorial configurations, quasiline arrangements, and systems of curves on surfaces, Unnamed Item, Characterizing 2-crossing-critical graphs, Irreducible triangulations of surfaces with boundary, 5-Connected Toroidal Graphs are Hamiltonian-Connected, Projective-planar signed graphs and tangled signed graphs, The nonorientable genus of joins of complete graphs with large edgeless graphs, On the nil-graph of ideals of commutative Artinian rings, Graph-like continua, augmenting arcs, and Menger's theorem, Subdivisions in apex graphs, Hyperbolic families and coloring graphs on surfaces, Embeddings of a graph into a surface with different weak chromatic numbers, Recent techniques and results on the Erdős-Pósa property, Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs, Rigid realizations of graphs with few locations in the plane, Layered separators in minor-closed graph classes with applications, On characterizing the class of cographic signed-graphic matroids, Multicuts in planar and bounded-genus graphs with bounded number of terminals, Connectivity and \(W_v\)-paths in polyhedral maps on surfaces, Extending the kernel for planar Steiner tree to the number of Steiner vertices, On the bounds of Conway's thrackles, Deciding Parity of Graph Crossing Number, Approximation Algorithms for Euler Genus and Related Problems, Generating even triangulations on the Klein bottle, Minimal Disconnected Cuts in Planar Graphs, On the hat guessing number of a planar graph class, Classification of Planar Upward Embedding, The Pfaffian property of graphs on the Möbius strip based on topological resolution, Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\), Unnamed Item, From Invariants to Canonization in Parallel, The Induced Disjoint Paths Problem, On the genus of the graph associated to a commutative ring, Unnamed Item, Minimal webs in Riemannian manifolds, A Direct Proof of the Strong Hanani–Tutte Theorem on the Projective Plane, Unnamed Item, Counting hexagonal patches and independent sets in circle graphs, Asymptotic enumeration and limit laws for graphs of fixed genus, Triangle-free projective-planar graphs with diameter two: domination and characterization, Local convergence of random planar graphs, Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey, Finding Large Independent Sets in Line of Sight Networks, Revisiting Decomposition by Clique Separators, Non-degenerated ground states and low-degenerated excited states in the antiferromagnetic Ising model on triangulations, A unified approach to distance-two colouring of graphs on surfaces, Local chromatic number of quadrangulations of surfaces, A note on the cops and robber game on graphs embedded in non-orientable surfaces, On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane, On the genus of the k-maximal hypergraph of commutative rings, Decomposing graphs into paths of fixed length, Graphs with no 7-wheel subdivision, Obstacle Numbers of Planar Graphs, Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs, Facial rainbow edge-coloring of simple 3-connected plane graphs, Power graphs of (non)orientable genus two, Minimum cycle bases of graphs on surfaces, On the flexibility of toroidal embeddings, Coloring graphs with fixed genus and girth, Planar Eulerian triangulations are equivalent to spherical Latin bitrades, The chromatic polynomial of fatgraphs and its categorification, A homological solution for the Gauss code problem in arbitrary surfaces, A note on rectilinear and polar visibility graphs, Unnamed Item, Unnamed Item, The nonorientable genus of complete tripartite graphs, Contractible Hamiltonian cycles in triangulated surfaces, Crossing and Weighted Crossing Number of Near-Planar Graphs, Approximating the Crossing Number of Apex Graphs, The genus of the balanced hypercube, Distributed Dominating Set Approximations beyond Planar Graphs, The joint distribution of the marginals of multipartite random quantum states, Rota-Baxter algebras, singular hypersurfaces, and renormalization on Kausz compactifications, A simple and elementary proof of Whitney's unique embedding theorem, Invariants of Graphs Modeling Nucleotide Rearrangements, The Common Structure of the Curves Having a Same Gauss Word, Packing and Covering Induced Subdivisions, An Approximation Algorithm for Fully Planar Edge-Disjoint Paths, On projective intersection graph of ideals of commutative rings, On Collinear Sets in Straight-Line Drawings, Relative Heffter arrays and biembeddings, Edge Coloring and the Möbius Strip, Archimedean maps of higher genera, Planar Digraphs, Extended Gallai's Theorem, Variations on a theme of Kuratowski, Upper bounds on the bondage number of a graph, Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes, A map colour theorem for the union of graphs, Tomography on Finite Graphs, Non-intersecting perfect matchings in cubic graphs (Extended abstract), Extended graph rotation systems as a model for cyclic weaving on orientable surfaces