Choosability in geometric hypergraphs

Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S ∈ E there is at least one vertex in S whose color is distinct from the colors of all other vertices in S. The study of this notion is motivated by frequency assignment problems in wireless networks. We introduce and study the list-coloring (or choice) version of this notion. List coloring arises naturally in the context of wireless networks.

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Panagiotis Cheilaris, Shakhar Smorodinsky
• Keywords: CORR 2010, Education, Frequency Assignment Problems, Hypergraph, Wireless Networks