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
Budapest, János Bolyai Mathematical Society
ISBN
963-8022-89-2
Note
Professor Pach's number: [116]
Laboratories
DCG
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > DCG - Chair of Combinatorial Geometry
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Work outside EPFL
Book chapters
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Work outside EPFL
Book chapters
Published
Record creation date
2008-11-18