Cover-Decomposition and Polychromatic Numbers

Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex Scott

Type: Book-Chapter

Publication Date: 2011-01-01

Citations: 1

DOI: https://doi.org/10.1007/978-3-642-23719-5_67

Similar Works

Action	Title	Year	Authors
+	Coverings, enumeration and Hurwitz problems	2008	Jaeun Lee Jin Ho Kwak Alexander Mednykh
+	Splittable Coverings of The Integers	2017	Sydney Miyasaki
+	Brown representability and flat covers	2001	Henning Krause
+	Coverings of Cantor sets	2000	Frederick P. Gardiner Linda Keen
+	Cone Theorems and Cyclic Covers	1991	Janós Kollár
+	Polychromatic Number of the Plane and Results Near the Upper Bound	2024	Alexander Soifer
+	Polychromatic Number of the Plane and Results Near the Upper Bound	2008	Alexander Soifer
+	Enumerability	2002	George Boolos John P. Burgess Richard C. Jeffrey
+	Cycles of covers	2008	E. V. Flynn J. Wunderle
+	Poly-iamond enumeration	1982	David R Ellard
+	Regular covers and metrization	2002	S LIN
+	Functional partitions and metrization	2016
+	Functional partitions and metrization	2024
+	P 4 -free Partition and Cover Numbers.	2020	Alexander R. Block Simina Brânzei Hemanta K. Maji Himanshi K. Mehta Tamalika Mukherjee Hai H. Nguyen
+	Black 1-factors and Dudeney sets	2010	Midori Kobayashi Brendan D. McKay Nobuaki Mutoh Gisaku Nakamura
+	Number Theory and Combinatorics	2018	Steven R. Finch
+	Number Theory and Combinatorics	2006	Titu Andreescu Bogdan Enescu
+	Number Theory and Combinatorics	2008
+	Number Theory and Combinatorics	2008
+	Number Theory and Combinatorics	2006	Titu Andreescu Bogdan Enescu

Action	Title	Year	Authors
+ PDF Chat	Colouring Non-Even Digraphs	2022	Marcelo Garlet Millani Raphael Steiner Sebastian Wiederrecht

Action	Title	Year	Authors
+	Lower bounds on the cover-index of a graph	1979	Lars Andersen
+ PDF Chat	Covering the plane with convex polygons	1986	János Pach
+ PDF Chat	Octants are Cover Decomposable	2011	Balázs Keszegh Dömötör Pálvölgyi
+ PDF Chat	The even cycle problem for directed graphs	1992	Carsten Thomassen
+ PDF Chat	A constructive proof of the Lovász local lemma	2009	Robin A. Moser
+ PDF Chat	Sentry Selection in Wireless Networks	2010	Paul Balister Béla Bollobás Amites Sarkar Mark Walters
+ PDF Chat	Multiple Coverings of the Plane with Triangles	2007	Gábor Tardos Gézá Tóth
+ PDF Chat	Tight lower bounds for the size of epsilon-nets	2011	János Pach Gábor Tardos
+ PDF Chat	On decompositions of a multi-graph into spanning subgraphs	1974	Ram P. Gupta
+	None	2009	Gruia Călinescu Chandra Chekuri J. Vondrák