K₇-minors in optimal 1-planar graphs
From MaRDI portal
Publication:2400554
Recommendations
Cites work
- scientific article; zbMATH DE number 3900784 (Why is no real title available?)
- scientific article; zbMATH DE number 5237285 (Why is no real title available?)
- scientific article; zbMATH DE number 4185634 (Why is no real title available?)
- $K_6$-Minors in Triangulations on the Klein Bottle
- K6-minors in triangulations and complete quadrangulations
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- A linear-time algorithm for 7-coloring 1-plane graphs
- Approximation algorithms for independent sets in map graphs
- Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
- Crossing Number Problems
- Ein Sechsfarbenproblem auf der Kugel
- Generation of simple quadrangulations of the sphere
- Homomorphiesätze für Graphen
- Minimal non-1-planar graphs
- On properties of maximal 1-planar graphs
- Re-embeddings of Maximum 1-Planar Graphs
- The Minor Crossing Number
- The crossing number of K11 is 100
- The structure of 1-planar graphs
- Zur Struktur 1‐planarer Graphen
- \(K_6\)-minors in projective planar graphs
- \(K_{6}\)-minors in triangulations on the nonorientable surface of genus 3
- Über 1-optimale Graphen
Cited in
(7)- scientific article; zbMATH DE number 1961003 (Why is no real title available?)
- \(K_7\)-minors in optimal 1-embedded graphs on the projective plane
- On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs
- On optimal beyond-planar graphs
- 1-Planar Graphs
- A note on 1-planar graphs with minimum degree 7
- Optimal 1-planar multigraphs
This page was built for publication: \(K_7\)-minors in optimal 1-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2400554)