Introduces facecon(G) as a spanning subgraph of the common neighbourhood graph con(G) for polyhedra and proves planarity conditions plus extremal characterizations for both graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Facial Common Neighbourhood Graph
Introduces facecon(G) as a spanning subgraph of the common neighbourhood graph con(G) for polyhedra and proves planarity conditions plus extremal characterizations for both graphs.