More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges
From MaRDI portal
Publication:4604522
Recommendations
- On the structure of polyhedral graphs with prescribed edge and dual edge weight
- Structure of edges in plane graphs with bounded dual edge weight
- Decompositions of plane graphs under parity constrains given by faces
- Face-degree bounds for planar critical graphs
- On two dual classes of planar graphs
- The edge-face choosability of plane graphs
- Note on vertex degrees of planar graphs
- Publication:4862217
- scientific article; zbMATH DE number 4212106
- A vertex-face assignment for plane graphs
Cites work
- A Kotzig type theorem for non-orientable surfaces
- Describing short paths in plane graphs of girth at least 5
- Light edges in 1-planar graphs with prescribed minimum degree
- On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree
- On the structure of polyhedral graphs with prescribed edge and dual edge weight
- On the total coloring of planar graphs.
- Quelques consequences simples de la formule d'Euler
- The structure of 1-planar graphs
Cited in
(7)- On the structure of polyhedral graphs with prescribed edge and dual edge weight
- Structure of edges in plane graphs with bounded dual edge weight
- Statuses and double branch weights of quadrangular outerplanar graphs
- Light 3-paths in 3-polytopes without adjacent triangles
- Minimal unavoidable sets of cycles in plane graphs with restricted minimum degree and edge weight
- Edge face graph and vertex face graph
- Light 3-faces in 3-polytopes without adjacent triangles
This page was built for publication: More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604522)