Generating the centrally symmetric 3-polyhedral graphs (Q1915141): Difference between revisions

Every centrally symmetric, 3-connected, planar graph can be constructed from the cube or the octahedron by applying pairs of symmetric face splittings.

0 references

zbMATH Keywords

polyhedral graph

0 references

planar graph

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q5589866

0 references

Generating planar 4-connected graphs

0 references

On generating planar graphs

0 references

Generating the \(c^*5\)-connected graphs

0 references

A construction of 3-connected graphs

0 references

0 references

0 references

0 references

0 references

Identifiers

zbMATH Open document ID

0853.05066

0 references

DOI

10.1007/BF01858449

0 references

Mathematics Subject Classification ID

05C75

0 references

zbMATH DE Number

887174

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1915141

@@ Property / cites work @@
+Q5589866
@@ Property / cites work: Q5589866 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating planar 4-connected graphs
@@ Property / cites work: Generating planar 4-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On generating planar graphs
@@ Property / cites work: On generating planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Generating the \(c^*5\)-connected graphs
@@ Property / cites work: Generating the \(c^*5\)-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A construction of 3-connected graphs
@@ Property / cites work: A construction of 3-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3689190
@@ Property / cites work: Q3689190 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5547252
@@ Property / cites work: Q5547252 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5597451
@@ Property / cites work: Q5597451 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3284374
@@ Property / cites work: Q3284374 / rank @@
+Normal rank