Bisection of Circle Colorings

From MaRDI portal
Publication:3222851

DOI10.1137/0606010zbMath0558.05008OpenAlexW2016462171WikidataQ59663880 ScholiaQ59663880MaRDI QIDQ3222851

Charles H. Goldberg, Douglas B. West

Publication date: 1985

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0606010




Related Items (29)

Consensus-Halving: Does It Ever Get Easier?Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshesSome combinatorial and algorithmic applications of the Borsuk-Ulam theoremMeasure partitions using hyperplanes with fixed directionsSplitting necklacesAn approach to emulating separable graphsThe Borsuk-Ulam Theorem and Bisection of NecklacesA survey of mass partitionsEquipartition of mass distributions by hyperplanesDiscrete geometry on colored point sets in the plane -- a surveyObstacles for splitting multidimensional necklacesSplitting multidimensional necklacesUnnamed ItemOptimal cache-oblivious mesh layoutsThieves can make sandwichesFair Division and Generalizations of Sperner- and KKM-type ResultsSimplotopal maps and necklace splittingComputing solutions of the paintshop-necklace problemThe Chromatic Number of Kneser HypergraphsUnnamed ItemSplitting necklaces and measurable colorings of the real lineConsensus-halving via theorems of Borsuk-Ulam and TuckerPaintshop, odd cycles and necklace splittingMultilabeled Versions of Sperner's and Fan's Lemmas and ApplicationsThe discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and TverbergThe complexity of finding fair independent sets in cyclesTwo's company, three's a crowd: consensus-halving for a constant number of agentsThe Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham SandwichConsensus Halving for Sets of Items



Cites Work


This page was built for publication: Bisection of Circle Colorings