Graphs on surfaces
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- 2-extendability of toroidal polyhexes and Klein-bottle polyhexes
- MacLane's theorem for arbitrary surfaces
- Generalized thrackle drawings of non-bipartite graphs
- On the upward embedding on the torus
- The orientable genus of some joins of complete graphs with large edgeless graphs
- 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
- Edge-decompositions of highly connected graphs into paths
- 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
- A simpler proof of the excluded minor theorem for higher surfaces
- Disk/band surfaces of spatial graphs
- Apex graphs with embeddings of face-width three
- Blocking nonorientability of a surface
- The chromatic number of a graph of girth 5 on a fixed surface
- Cubic inflation, mirror graphs, regular maps, and partial cubes
- The monadic second-order logic of graphs. XII: Planar graphs and planar maps
- Grinberg's criterion
- Length bounds for cycle bases of graphs
- Chromatic numbers of exact distance graphs
- More on the new large \(D\) limit of matrix models
- Hamiltonian cycles in polyhedral maps
- The square of a planar cubic graph is 7-colorable
- Newton flows for elliptic functions. II: Structural stability: classification and representation
- 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}\)
- 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
- Pentagonal maps on the torus and the plane
- 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
- Generating even triangulations on the torus
- Fast minor testing in planar graphs
- Parameterized complexity of the spanning tree congestion problem
- 2-restricted extensions of partial embeddings of graphs
- Counterexamples to the nonorientable genus conjecture for complete tripartite graphs
- Acyclic colorings of locally planar graphs
- Extending Lipschitz functions via random metric partitions
- A note on directed genera of some tournaments
- Quadrangulations and 4-color-critical graphs
- Halin's theorem for cubic graphs on an annulus
- Straight-ahead walks in Eulerian graphs
- 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
- 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
- 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
- On the excluded minor structure theorem for graphs of large tree-width
- Approximation algorithms via contraction decomposition
- Lattices, graphs, and Conway mutation
- A Tutte polynomial for maps. II: The non-orientable case
- The (\(n\), \(k\))-extendable graphs in surfaces
- 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
- Game edge-connectivity of graphs
- Polynomial degeneracy for the first \(m\) energy levels of the antiferromagnetic Ising model
- 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
- Maps of unfixed genus and blossoming trees
- \(z\)-knotted triangulations of surfaces
- On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces
- 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
- Iterated foldings of discrete spaces and their limits: candidates for the role of Brownian map in higher dimensions
- 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
This page was built for publication: Graphs on surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2726740)
