Removing even crossings
From MaRDI portal
Publication:885288
DOI10.1016/J.JCTB.2006.08.001zbMATH Open1118.05023OpenAlexW2197963488MaRDI QIDQ885288FDOQ885288
Authors: Michael J. Pelsmajer, Marcus Schaefer, D. Štefankovič 
Publication date: 8 June 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2006.08.001
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
- Research Problems in Discrete Geometry
- Bounds for rectilinear crossing numbers
- Pfaffian graphs, \(T\)-joins and crossing numbers
- Title not available (Why is that?)
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Which crossing number is it anyway?
- Toward a theory of crossing numbers
- Bounds for generalized thrackles
- Über wesentlich unplättbare Kurven im dreidimensionalen Raume
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on the parity of the number of crossings of a graph
- Graphs and obstructions in four dimensions.
- Title not available (Why is that?)
- Graph Drawing
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
- Towards the Hanani-Tutte theorem for clustered graphs
- Algebraic characterizations of outerplanar and planar graphs
- Title not available (Why is that?)
- 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
- Adjacent Crossings Do Matter
- On the Size of Planarly Connected Crossing Graphs
- A parity theorem for drawings of complete and complete
- Unified Hanani-Tutte theorem
- Hanani-Tutte and related results
- Removing Even Crossings on Surfaces
- 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)
