Representing products of polyhedra by products of edge‐colored graphs

DOI10.1002/jgt.3190170502zbMath0781.05020OpenAlexW2167744845MaRDI QIDQ4271611

Luigi Grasselli, Carlo Gagliardi

Publication date: 19 December 1993

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190170502

zbMATH Keywords

polyhedraproductedge-colored graphs

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Lower bounds for regular genus and gem-complexity of PL 4-manifolds ⋮ Lower bounds for regular genus and gem-complexity of PL 4-manifolds with boundary ⋮ Face vectors of simplicial cell decompositions of manifolds ⋮ Genus-minimal crystallizations of PL 4-manifolds ⋮ On reduced complexity of closed piecewise linear 5-manifolds ⋮ Regular genus and gem-complexity of some mapping tori

Cites Work

• Unnamed Item
• Unnamed Item
• Crystallisation moves
• Handles in graphs and sphere bundles over \(S^ 1\)

This page was built for publication: Representing products of polyhedra by products of edge‐colored graphs