Recommendations
- scientific article; zbMATH DE number 5763167
- Removing independently even crossings
- Removing Independently Even Crossings
- Removing even crossings on surfaces
- Removing Even Crossings on Surfaces
- Unlinking Via Simultaneous Crossing Changes
- Crossings in grid drawings
- Crossing numbers
- scientific article; zbMATH DE number 1507304
- Graph-Theoretic Concepts in Computer Science
Cites work
- scientific article; zbMATH DE number 3503275 (Why is no real title available?)
- scientific article; zbMATH DE number 1342089 (Why is no real title available?)
- scientific article; zbMATH DE number 1454642 (Why is no real title available?)
- scientific article; zbMATH DE number 1507304 (Why is no real title available?)
- A note on the parity of the number of crossings of a graph
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Bounds for generalized thrackles
- Bounds for rectilinear crossing numbers
- Graph Drawing
- Graphs and obstructions in four dimensions.
- Pfaffian graphs, \(T\)-joins and crossing numbers
- Research Problems in Discrete Geometry
- Toward a theory of crossing numbers
- Which crossing number is it anyway?
- Über wesentlich unplättbare Kurven im dreidimensionalen Raume
Cited in
(24)- On pseudo-disk hypergraphs
- Crossing numbers of graphs with rotation systems
- Hanani-Tutte and monotone drawings
- A direct proof of the strong Hanani-Tutte theorem on the projective plane
- Algebraic characterizations of outerplanar and planar graphs
- Towards the Hanani-Tutte theorem for clustered graphs
- scientific article; zbMATH DE number 5763167 (Why is no real title available?)
- Hanani-Tutte for Radial Planarity II
- Removing independently even crossings
- Thrackles, superthrackles and the Hanani-Tutte theorem
- On the strong Hanani-Tutte theorem
- Crossing lemma for the odd-crossing number
- Clustered planarity testing revisited
- Removing even crossings on surfaces
- On the Size of Planarly Connected Crossing Graphs
- Adjacent Crossings Do Matter
- Unified Hanani-Tutte theorem
- A parity theorem for drawings of complete and complete
- Removing Even Crossings on Surfaces
- Hanani-Tutte and related results
- Hanani-Tutte for radial planarity. II
- Connectivity augmentation in planar straight line graphs
- Hanani-Tutte for approximating maps of graphs
- Finding Minors in Graphs with a Given Path Structure
This page was built for publication: Removing even crossings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q885288)
