Premium
Representing products of polyhedra by products of edge‐colored graphs
Author(s) -
Gagliardi Carlo,
Grasselli Luigi
Publication year - 1993
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190170502
Subject(s) - colored , combinatorics , mathematics , graph , polyhedron , discrete mathematics , materials science , composite material
Given an ( m + 1)‐colored graph ( Γ γ′) and an ( n + 1)‐colored graph (, γ″), representing two polyhedra P′, P″ respectively, we present a direct construction of an ( m + n +1)‐colored graph ( Γ ′⊠ Γ ″, γ′ ⊠ γ″), which represents the product P ′ × P ″. Some examples, applications, and conjectures about the genus of manifold products are also presented. © 1993 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom