Colorful polytopes and graphs

DOI10.1007/S11856-012-0136-7zbMATH Open1275.05019arXiv1203.5175OpenAlexW2129092968MaRDI QIDQ375685FDOQ375685

Isabel Hubard, Egon Schulte, G. Araujo-Pardo, Deborah Oliveros

Publication date: 31 October 2013

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Abstract: The paper investigates connections between abstract polytopes and properly edge colored graphs. Given any finite n-edge-colored n-regular graph G, we associate to G a simple abstract polytope P_G of rank n, called the colorful polytope of G, with 1-skeleton isomorphic to G. We investigate the interplay between the geometric, combinatorial, or algebraic properties of the polytope P_G and the combinatorial or algebraic structure of the underlying graph G, focussing in particular on aspects of symmetry. Several such families of colorful polytopes are studied including examples derived from a Cayley graph, in particular the graphicahedra, as well as the flag adjacency polytopes and related monodromy polytopes associated with a given abstract polytope. The duals of certain families of colorful polytopes have been important in the topological study of colored triangulations and crystallization of manifolds.

Full work available at URL: https://arxiv.org/abs/1203.5175

Recommendations

• Colorful graph associahedra
• Facets of the graph coloring polytope
• Color symmetry and colored polyhedra
• Coloring the Platonic Solids
• scientific article; zbMATH DE number 4046711
• Colorful associahedra and cyclohedra
• scientific article
• scientific article; zbMATH DE number 2039297

zbMATH Keywords

colored triangulationscrystallization of manifoldsproperly edge colored graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Cites Work

• Title not available (Why is that?)
• Abstract Regular Polytopes
• Map operations and \(k\)-orbit maps
• Monodromy groups and self-invariance
• A Geometrical Approach to Imprimitive Graphs
• A simple way to tell a simple polytope from its graph
• Polytopes of high rank for the symmetric groups
• Graph-encoded 3-manifolds
• A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
• The combinatorics of colored triangulations of manifolds
• On the chromatic index of almost all graphs
• Reguläre Inzidenzkomplexe. I
• Puzzles and polytope isomorphisms
• All polytopes are quotients, and isomorphic polytopes are quotients by conjugate subgroups
• Title not available (Why is that?)
• Symmetric graphicahedra
• On the size of equifacetted semi-regular polytopes
• Cayley graphs and symmetric 4-polytopes
• The structure of automorphism groups of Cayley graphs and maps.
• The graphicahedron
• Medial layer graphs of equivelar 4-polytopes
• Semisymmetric graphs from polytopes

Cited In (9)

• Title not available (Why is that?)
• All polytopes are coset geometries: characterizing automorphism groups of \(k\)-orbit abstract polytopes
• On Roli's cube
• Representing products of polyhedra by products of edge‐colored graphs
• Quadratically Many Colorful Simplices
• Title not available (Why is that?)
• Colorful associahedra and cyclohedra
• A finite chiral 4-polytope in \(\mathbb R^4\)
• Title not available (Why is that?)

This page was built for publication: Colorful polytopes and graphs

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