Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces
暂无分享,去创建一个
[1] Adam Hesterberg,et al. Three Colors Suffice: Conflict-Free Coloring of Planar Graphs , 2017, SODA.
[2] Norishige Chiba,et al. A Linear 5-Coloring Algorithm of Planar Graphs , 1981, J. Algorithms.
[3] Shakhar Smorodinsky,et al. Conflict-Free Coloring and its Applications , 2010, ArXiv.
[4] Noga Alon,et al. Conflict-free colorings of shallow discs , 2006, SCG '06.
[5] Shakhar Smorodinsky,et al. Conflict-Free Coloring of Intersection Graphs of Geometric Objects , 2017, Discrete & Computational Geometry.
[6] Amos Fiat,et al. Online conflict-free coloring for intervals , 2005, SODA '05.
[7] M. Sharir,et al. Combinatorial problems in computational geometry , 2003 .
[8] Suzanne M. Seager,et al. Ordered colourings , 1995, Discret. Math..
[9] Abam,et al. Online conflict-free coloring of intervals , 2014 .
[10] Klaus Jansen,et al. Rankings of Graphs , 1998, SIAM J. Discret. Math..
[11] Dana Ron,et al. Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[12] Robin Thomas,et al. Efficiently four-coloring planar graphs , 1996, STOC '96.
[13] Shakhar Smorodinsky. On the chromatic number of some geometric hypergraphs , 2006, SODA '06.
[14] Sariel Har-Peled,et al. Conflict-Free Coloring of Points and Simple Regions in the Plane , 2005, Discret. Comput. Geom..
[15] Mark de Berg,et al. Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points , 2017, ISAAC.
[16] János Pach,et al. Conflict-Free Colourings of Graphs and Hypergraphs , 2009, Combinatorics, Probability and Computing.