In two different ways:

- Adrian Dumitrescu, Masud Hasan: Cutting Out Polygons with a Circular Saw. ISAAC 2011: 230-239

- Adrian Dumitrescu, Janos Pach: Partitioning Colored Point Sets into Monochromatic Parts. WADS 2001: 264-275

- Paul Erdos, Ralph J. Faudree, Janos Pach, Joel H. Spencer: How to make a graph bipartite. J. Comb. Theory, Ser. B 45(1): 86-98 (1988)

- Masud Hasan and Anna Lubiw, Equiprojective Polyhedra, CGTA 40(2): 148-155 (2008)

- Kratochvil, Jan; Lubiw, Anna; Nesetril, Jaroslav ,"Noncrossing subgraphs in topological layouts". SIAM J. Discrete Math. 4 (1991), no. 2, 223--244

- Erdos, Paul; Nesetril, Jaroslav; Rodl, Vojtech "On some problems related to partitions of edges of a graph". Graphs and other combinatorial topics (Prague, 1982), 54--63, Teubner-Texte Math., 59, Teubner, Leipzig, 1983