http://openproblemgarden.org/op/obstacle_number_of_planar_graphs Comments for "Obstacle number of planar graphs" en http://openproblemgarden.org/op/obstacle_number_of_planar_graphs <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/alpert_hanna">Alpert</a>; <a href="/category/koch_christina">Koch</a>; <a href="/category/laison_joshua_d">Laison</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <p>Does there exist a planar graph with obstacle number greater than 1? Is there some <img class="teximage" src="/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png" alt="$ k $" /> such that every planar graph has obstacle number at most <img class="teximage" src="/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png" alt="$ k $" />? </p> </tr></td> </table> </td> </tr> </table> Alpert, Hanna Koch, Christina Laison, Joshua D. graph drawing obstacle number planar graph visibility graph Graph Theory http://openproblemgarden.org/op/obstacle_number_of_planar_graphs#comment Wed, 23 Nov 2011 01:19:22 +0100 Andrew King 37357 at http://openproblemgarden.org