An algorithm for finding many disjoint monochromatic edges in a complete 2-colored geometric graph
1997
Files
Details
Title
An algorithm for finding many disjoint monochromatic edges in a complete 2-colored geometric graph
Author(s)
Pach, János ; Károlyi, G. ; Tardos, Gábor ; Tóth, Géza
Published in
Intuitive Geometry
Series
Bolyai Society mathematical studies, 6
Pages
367-372
Date
1997
Publisher
Berlin, Springer
Note
Professor Pach's number: [116]
Laboratories
DCG