Hlín

Results: 16



#Item
1Computing the Stretch of an Embedded Graph∗ Sergio Cabello† Markus Chimani‡ Petr Hlinˇen´

Computing the Stretch of an Embedded Graph∗ Sergio Cabello† Markus Chimani‡ Petr Hlinˇen´

Add to Reading List

Source URL: www.fmf.uni-lj.si

- Date: 2013-11-17 15:26:27
    2On Parse Trees and Myhill–Nerode–type Tools for handling Graphs of Bounded Rank-width? Robert Ganian and Petr Hlinˇen´ y?? Faculty of Informatics, Masaryk University

    On Parse Trees and Myhill–Nerode–type Tools for handling Graphs of Bounded Rank-width? Robert Ganian and Petr Hlinˇen´ y?? Faculty of Informatics, Masaryk University

    Add to Reading List

    Source URL: iti.mff.cuni.cz

    Language: English - Date: 2016-02-04 05:53:37
      3Crossing Number is Hard for Cubic Graphs Petr Hlinˇ en´ y Department of Computer Science ˇ – Technical University Ostrava

      Crossing Number is Hard for Cubic Graphs Petr Hlinˇ en´ y Department of Computer Science ˇ – Technical University Ostrava

      Add to Reading List

      Source URL: iti.mff.cuni.cz

      Language: English - Date: 2016-02-04 05:53:36
        4Erratum: 35 minor minimal nonprojective graphs Unfortunately, two of the pictures – of D 12 and E 11 – published in the appendices of some of the papers on Negami’s conjecture by P. Hlinˇen´ y et al, were incorre

        Erratum: 35 minor minimal nonprojective graphs Unfortunately, two of the pictures – of D 12 and E 11 – published in the appendices of some of the papers on Negami’s conjecture by P. Hlinˇen´ y et al, were incorre

        Add to Reading List

        Source URL: www.fi.muni.cz

        - Date: 2013-02-25 04:18:37
          5Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids? Petr Hlinˇ en´ y School of Mathematical and Computing Sciences,

          Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids? Petr Hlinˇ en´ y School of Mathematical and Computing Sciences,

          Add to Reading List

          Source URL: www.fi.muni.cz

          Language: English - Date: 2005-07-07 11:28:02
          6Stars and Bonds in Crossing-Critical Graphs Petr Hlinˇ en´ y1 and Gelasio Salazar2 1

          Stars and Bonds in Crossing-Critical Graphs Petr Hlinˇ en´ y1 and Gelasio Salazar2 1

          Add to Reading List

          Source URL: www.fi.muni.cz

          Language: English - Date: 2008-09-19 09:20:43
          7Crossing Number is Hard for Cubic Graphs? Petr Hlinˇ en´ y Department of Computer Science ˇ – Technical University of Ostrava,

          Crossing Number is Hard for Cubic Graphs? Petr Hlinˇ en´ y Department of Computer Science ˇ – Technical University of Ostrava,

          Add to Reading List

          Source URL: www.fi.muni.cz

          Language: English - Date: 2005-02-11 15:57:54
          8Crossing-Number Critical Graphs have Bounded Path-width Petr Hlinˇ en´ y? School of Mathematical and Computing Sciences,

          Crossing-Number Critical Graphs have Bounded Path-width Petr Hlinˇ en´ y? School of Mathematical and Computing Sciences,

          Add to Reading List

          Source URL: www.fi.muni.cz

          Language: English - Date: 2005-02-11 15:58:00
          9Planar Emulators Conjecture Is Nearly True for Cubic Graphs Martin Derkaa , Petr Hlinˇen´ yb,1 a David

          Planar Emulators Conjecture Is Nearly True for Cubic Graphs Martin Derkaa , Petr Hlinˇen´ yb,1 a David

          Add to Reading List

          Source URL: www.fi.muni.cz

          Language: English - Date: 2013-12-16 02:39:42
          10When Trees Grow Low: Shrubs and Fast MSO1 Robert Ganian1 , Petr Hlinˇen´ y2 , Jaroslav Neˇsetˇril3 , Jan Obdrˇz´alek2 , Patrice Ossona de Mendez4 , and Reshma Ramadurai2 1

          When Trees Grow Low: Shrubs and Fast MSO1 Robert Ganian1 , Petr Hlinˇen´ y2 , Jaroslav Neˇsetˇril3 , Jan Obdrˇz´alek2 , Patrice Ossona de Mendez4 , and Reshma Ramadurai2 1

          Add to Reading List

          Source URL: www.fi.muni.cz

          Language: English - Date: 2012-06-17 02:27:41