Relationship among triangulations, quadrangulations and optimal 1-planar graphs
From MaRDI portal
Publication:897254
DOI10.1007/S00373-015-1568-8zbMATH Open1329.05088OpenAlexW1974494866MaRDI QIDQ897254FDOQ897254
Authors: Kenta Noguchi, Yusuke Suzuki
Publication date: 17 December 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-015-1568-8
Recommendations
Cites Work
- Ein Sechsfarbenproblem auf der Kugel
- The structure of 1-planar graphs
- A Theorem on Planar Graphs
- 4-connected projective planar graphs are Hamiltonian
- Toughness in graphs -- a survey
- Optimal 1-planar graphs which triangulate other surfaces
- Re-embeddings of Maximum 1-Planar Graphs
- On properties of maximal 1-planar graphs
- Extension to Even Triangulations
Cited In (9)
- Generating polyhedral quadrangulations of the projective plane
- 1-Planar Graphs
- Optimal 1-planar graphs which triangulate other surfaces
- Title not available (Why is that?)
- The matching extendability of optimal 1-planar graphs
- Optimal 1-planar multigraphs
- Minimum Wiener index of triangulations and quadrangulations
- Optimal 1-planar graphs which quadrangulate other surfaces
- Optimal 1-embedded graphs on the projective plane which triangulate other surfaces
This page was built for publication: Relationship among triangulations, quadrangulations and optimal 1-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897254)