Some properties of Bowlin and Brin's color graphs
From MaRDI portal
Publication:2279277
Abstract: Bowlin and Brin defined the class of color graphs, whose vertices are triangulated polygons compatible with a fixed four-coloring of the polygon vertices. In this article it is proven that each color graph has a vertex-induced embedding in a hypercube, and an upper bound is given for the hypercube dimension. The color graphs for -gons up to are listed and some of their features are discussed. Finally it is shown that certain color graphs cannot be isometrically embedded in a hypercube of any dimension.
Recommendations
Cites work
- Coloring planar graphs via colored paths in the associahedra
- Distance-preserving subgraphs of hypercubes
- Flips signés et triangulations d'un polygone. (Signed flips and triangulations of a polygon)
- On signed diagonal flip sequences
- Partial cubes: Structures, characterizations, and constructions
- Signed diagonal flips and the four color theorem
- Signed permutations and the four color theorem
Cited in
(3)
This page was built for publication: Some properties of Bowlin and Brin's color graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279277)