The structure of cubic planar graphs with triangular and hexagonal faces

MaRDI QIDQ2831569zbMATH OpenFDO

Authors Dragos-Radu Popescu, Ruxandra Marinescu-Ghemeci

Publication date 10 November 2016

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

cubic graphsplanar graphsstructure

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Review text

A graph is called a cubic graph if all vertices have degree three, i.e., there are exactly three edges through each vertex. A graph is called a planar graph if it can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In this article the authors consider only those cubic planar graphs in which every region (in the plane) is bounded by either three edges or by six edges. They then completely describe the structure of such a graph.

Recommendations

• Plane Cubic Graphs with Prescribed Face Areas
• scientific article; zbMATH DE number 841996
• scientific article; zbMATH DE number 850944
• scientific article; zbMATH DE number 1264876
• scientific article; zbMATH DE number 3963871

Cited in

(2)

• scientific article; zbMATH DE number 5005324 (Why is no real title available?)
• scientific article; zbMATH DE number 841996 (Why is no real title available?)

This page was built for publication: The structure of cubic planar graphs with triangular and hexagonal faces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2831569)