Proper 1-immersions of graphs triangulating the plane
From MaRDI portal
(Redirected from Publication:394202)
Recommendations
Cites work
- scientific article; zbMATH DE number 3900784 (Why is no real title available?)
- scientific article; zbMATH DE number 95245 (Why is no real title available?)
- scientific article; zbMATH DE number 1775439 (Why is no real title available?)
- scientific article; zbMATH DE number 1396798 (Why is no real title available?)
- A linear-time algorithm for 7-coloring 1-plane graphs
- A new proof of the 6 color theorem
- Approximation algorithms for independent sets in map graphs
- Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
- Computing and Combinatorics
- Ein Sechsfarbenproblem auf der Kugel
- Graphs drawn with few crossings per edge
- Map graphs
- Minimal non-1-planar graphs
- On the density of maximal 1-planar graphs
- Re-embeddings of Maximum 1-Planar Graphs
- Rectilinear drawings of graphs
- Right angle crossing graphs and 1-planarity
- Testing maximal 1-planarity of graphs with a rotation system in linear time (extended abstract)
- The structure of 1-planar graphs
- Zur Struktur 1‐planarer Graphen
Cited in
(5)
This page was built for publication: Proper 1-immersions of graphs triangulating the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394202)