Colouring polytopic partitions in $\mathbb{R}^d$

DOI10.21136/MB.2002.134161zbMATH Open1003.05042OpenAlexW2597585102MaRDI QIDQ4783789

Michal Křížek

Publication date: 9 December 2002

Full work available at URL: https://eudml.org/doc/32793

zbMATH Keywords

finite element methodsdomain decomposition methodscombinatorial geometrychromatic numberparallel programmingconvex polytopestetrahedralizationfour colour theoremcolouring multidimensional mapssix colour conjecture

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Polyhedra and polytopes; regular figures, division of spaces (51M20) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Polychromatic colorings of arbitrary rectangular partitions

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Colored partitions of a convex polygon by noncrossing diagonals 👍 👎
• Polychromatic colorings of rectangular partitions 👍 👎
• Polychromatic colorings of arbitrary rectangular partitions 👍 👎
• Colorful coverings of polytopes and piercing numbers of colorful \(d\)-intervals 👍 👎
• Coloring \({\mathbb R}^n\) 👍 👎
• Polychromatic Colorings of n-Dimensional Guillotine-Partitions 👍 👎
• Sperner’s Colorings and Optimal Partitioning of the Simplex 👍 👎
• Enumerating coloured partitions in 2 and 3 dimensions 👍 👎

This page was built for publication: Colouring polytopic partitions in $\mathbb{R}^d$

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