A characterization theorem for nonmaximal partial-dual planar graphs and the maximum partial-dual genus for a planar triangulated graph
From MaRDI portal
Publication:6631991
DOI10.12386/A20220161MaRDI QIDQ6631991
Publication date: 4 November 2024
Published in: Acta Mathematica Sinica. Chinese Series (Search for Journal in Brave)
partial-dualplanar triangulated graphsthe maximal partial-dual planar graphthe maximum partial-dual genus
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partial duals of plane graphs, separability and the graphs of knots
- Bipartite partial duals and circuits in medial graphs
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- How to determine the maximum genus of a graph
- A new characterization of the maximum genus of a graph
- Eulerian partial duals of plane graphs
This page was built for publication: A characterization theorem for nonmaximal partial-dual planar graphs and the maximum partial-dual genus for a planar triangulated graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6631991)
