Generating polyhedral quadrangulations of the projective plane
From MaRDI portal
Publication:5217067
DOI10.26493/1855-3974.1195.c71zbMath1433.05090OpenAlexW2973806997WikidataQ127228893 ScholiaQ127228893MaRDI QIDQ5217067
Publication date: 21 February 2020
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.1195.c71
Planar graphs; geometric and topological aspects of graph theory (05C10) General theory of linear incidence geometry and projective geometries (51A05)
Related Items (3)
Finitizable set of reductions for polyhedral quadrangulations of closed surfaces ⋮ Y-equivalence and rhombic realization of projective-planar quadrangulations ⋮ 1-embeddability of complete multipartite graphs on the projective plane
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- Polyhedral embeddings of snarks with arbitrary nonorientable genera
- Relationship among triangulations, quadrangulations and optimal 1-planar graphs
- An inductive definition of the class of 3-connected quadrangulations of the plane
- Optimal 1-planar graphs which triangulate other surfaces
- Flexibility of polyhedral embeddings of graphs in surfaces
- Three-coloring graphs embedded on surfaces with all faces even-sided
- Irreducible quadrangulations of the torus
- Diagonal transformations and cycle parities of quadrangulations on surfaces
- Generation of simple quadrangulations of the sphere
- Chromatic numbers of quadrangulations on closed surfaces
- Cube-contractions in 3-connected quadrangulations
- On properties of maximal 1-planar graphs
- Re-embeddings of Maximum 1-Planar Graphs
- On Polyhedral Embeddings of Cubic Graphs
- Generating quadrangulations of surfaces with minimum degree at least 3
- Generating all 3‐connected 4‐regular planar graphs from the octahedron graph
- No optimal 1‐planar graph triangulates any nonorientable closed surface
- Note on irreducible triangulations of surfaces
- Existence of polyhedral embeddings of graphs
This page was built for publication: Generating polyhedral quadrangulations of the projective plane
