The degenerate crossing number and higher-genus embeddings

DOI10.7155/JGAA.00580MaRDI QIDQ5084703zbMATH OpenOpenAlexFDO

Authors Marcus Schaefer, D. Štefankovič

Publication date 28 June 2022

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00580

zbMATH Keywords

bundled crossing numberdegenerate crossing numbergenus crossing numbernon-orientable genus

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The Degenerate Crossing Number and Higher-Genus Embeddings
• The genus crossing number
• On the degenerate crossing number
• Drawings of graphs on surfaces with few crossings
• Planar crossing numbers of graphs of bounded genus

Cites work

• A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection
• Approximation algorithms for Euler genus and related problems
• Block additivity of \(\mathbb Z_{2}\)-embeddings
• Bounds for generalized thrackles
• Bundled Crossings in Embedded Graphs
• Bundled crossings revisited
• Computing a canonical polygonal schema of an orientable triangulated surface
• Degenerate crossing numbers
• Graph drawing and network visualization. 24th international symposium, GD 2016, Athens, Greece, September 19--21, 2016. Revised selected papers
• Graphs on surfaces
• scientific article; zbMATH DE number 412172 (Why is no real title available?)
• scientific article; zbMATH DE number 3914340 (Why is no real title available?)
• On the degenerate crossing number
• Optimally cutting a surface into a disk
• Planar drawings of higher-genus graphs
• Polylogarithmic approximation for Euler genus on bounded degree graphs
• Removing even crossings on surfaces
• The genus crossing number
• The genus problem for cubic graphs
• The graph crossing number and its variants: a survey

Cited in

(9)

• On the embedding genus distribution of ladders and crosses
• Higher genus quasimap wall-crossing for semipositive targets
• Independence of volume and genus 𝑔 bridge numbers
• The Degenerate Crossing Number and Higher-Genus Embeddings
• The genus crossing number
• Minimal crossing number implies minimal supporting genus
• Low-dimensional topology. Abstracts from the workshop held January 15--21, 2023
• Short topological decompositions of non-orientable surfaces
• Computing shortest closed curves on non-orientable surfaces

This page was built for publication: The degenerate crossing number and higher-genus embeddings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084703)