#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2009

2013

- This year (0)
- Last 5 years (2)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Elad Horev, Roi Krakovski
- Journal of Graph Theory
- 2009

- Elad Horev, Roi Krakovski, Shakhar Smorodinsky
- SWAT
- 2010

In FOCS 2002, Even et al. showed that any set of n discs in the plane can be Conflict-Free colored with a total of at most O(log n) colors. That is, it can be colored with O(log n) colors such that for any (covered) point p there is some disc whose color is distinct from all other colors of discs containing p. They also showed that this bound is… (More)

- Elad Horev, Matthew J. Katz, Roi Krakovski, Atsuhiro Nakamoto
- Discrete Mathematics
- 2012

It is proved that the vertices of a cubic bipartite plane graph can be colored with four colors such that each face meets all four colors. This is tight, since any such graph contains at least six faces of size four.

- Darko Dimitrov, Elad Horev, Roi Krakovski
- Discrete Mathematics
- 2009

- Elad Horev, Matthew J. Katz, Roi Krakovski, Maarten Löffler
- Inf. Process. Lett.
- 2009

- Elad Horev
- Journal of Graph Theory
- 2011

- Elad Horev, Michael Lomonosov
- Journal of Graph Theory
- 2013

- Elad Horev
- Discrete Mathematics
- 2011

Graphs distinguished by Kr -minor prohibition limited to subgraphs induced by circuits have chromatic number bounded by a function f (r); precise bounds on f (r) are unknown. If minor prohibition is limited to subgraphs induced by simple paths instead of circuits, then for certain forbidden configurations, we reach tight estimates. A graph whose simple… (More)

- ‹
- 1
- ›