1-Planar Graphs
From MaRDI portal
Recommendations
- The structure of 1-planar graphs
- Zur Struktur 1‐planarer Graphen
- A note on 1-planar graphs
- Outer 1-planar graphs
- Algorithms for 1-Planar Graphs
- scientific article; zbMATH DE number 4154462
- scientific article; zbMATH DE number 1099607
- On drawings and decompositions of 1-planar graphs
- scientific article; zbMATH DE number 6381690
Cites work
- 1-planarity of complete multipartite graphs
- \(K_7\)-minors in optimal 1-planar graphs
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- A Theorem on Planar Graphs
- Algorithms for graphs embeddable with few crossings per edge
- An annotated bibliography on 1-planarity
- An upper bound on the number of edges in an almost planar bipartite graph
- Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
- Coloring vertices and faces of locally planar graphs
- Cyclic 4-colorings of graphs on surfaces
- Ein Sechsfarbenproblem auf der Kugel
- Graph theory
- Graphs drawn with few crossings per edge
- Homomorphiesätze für Graphen
- Improvements on the density of maximal 1-planar graphs
- Minimal non-1-planar graphs
- On properties of maximal 1-planar graphs
- On the density of maximal 1-planar graphs
- Optimal 1-embedded graphs on the projective plane which triangulate other surfaces
- Re-embeddings of Maximum 1-Planar Graphs
- Relationship among triangulations, quadrangulations and optimal 1-planar graphs
- Some Hamiltonian results in powers of graphs
- The crossing number of K5,n
- The matching extendability of optimal 1-planar graphs
- The structure of 1-planar graphs
- Zur Struktur 1‐planarer Graphen
- Über 1-optimale Graphen
Cited in
(20)- The maximal 1-planarity and crossing numbers of graphs
- An annotated bibliography on 1-planarity
- scientific article; zbMATH DE number 6381690 (Why is no real title available?)
- scientific article; zbMATH DE number 5943498 (Why is no real title available?)
- Algorithms for 1-Planar Graphs
- Optimal 1-planar multigraphs
- A new note on 1-planar graphs with minimum degree 7
- Nonplanar Graph Drawings with k Vertices per Face
- Partially broken orientations of Eulerian graphs on closed surfaces
- K₇-minors in optimal 1-embedded graphs on the projective plane
- The matching extendability of optimal 1-embedded graphs on the projective plane
- 4-connected 1-planar chordal graphs are Hamiltonian-connected
- The matching extendability of 7-connected maximal 1-plane graphs
- Exact and approximate k-planarity testing for maximal graphs of small pathwidth
- Connectivity and matching extendability of optimal 1-embedded graphs on the torus
- Complexity of (p, q)-bipartition of planar and 1-planar graphs
- Heuristics for exact 1-planarity testing
- Crossing number of simple 3-plane drawings
- Crossing number of simple 3-plane drawings
- Heuristics for exact 1-planarity testing
This page was built for publication: 1-Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001656)