Graphs

Results: 4392



#Item
391

A Linear Kernel for Finding Square Roots of Almost Planar Graphs Petr A. Golovach1 , Dieter Kratsch2 , Dani¨el Paulusma3 , and Anthony Stewart3 1 2

Add to Reading List

Source URL: community.dur.ac.uk

- Date: 2016-04-01 09:07:08
    392

    5-choosability of graphs with crossings far apart∗ Zdenˇek Dvoˇra´k† Bernard Lidick´ y‡

    Add to Reading List

    Source URL: orion.math.iastate.edu

    - Date: 2016-08-11 07:06:11
      393

      5-list-coloring planar graphs with distant precolored vertices Zdenˇek Dvoˇra´k∗ Bernard Lidick´ y†

      Add to Reading List

      Source URL: orion.math.iastate.edu

      - Date: 2014-08-22 14:45:13
        394

        Graphs and Functions:Recurring Themes in Databases

        Add to Reading List

        Source URL: www.dcs.bbk.ac.uk

        - Date: 2015-10-17 15:48:42
          395

          LEAVES OF LAMINATIONS AND COLORINGS OF GRAPHS ´ BARRAL LIJO ´ RAMON Abstract. Consider triples (M, f, x), where M is an n-dimensional manifold, x ∈ M and f ∈ C ∞ (M, H),

          Add to Reading List

          Source URL: foliations2016.math.uni.lodz.pl

          - Date: 2016-06-07 16:45:39
            396

            Crossing numbers of complete tripartite and balanced complete multipartite graphs Ellen Gethner∗, Leslie Hogben†, Bernard Lidick´ y‡, Florian Pfender§, Amanda Ruiz¶, Michael Young‡ October 2, 2014

            Add to Reading List

            Source URL: orion.math.iastate.edu

            - Date: 2014-10-02 17:38:28
              397

              Graphs associated to CAT (0) cube complexes Mark Hagen McGill University Cornell Topology Seminar, 15 November 2011

              Add to Reading List

              Source URL: www.wescac.net

              - Date: 2014-06-23 02:55:19
                398

                Lecture 24 Spectral Graph Theory Strongly Regular Graphs, part 2 November 20, 2009

                Add to Reading List

                Source URL: www.cs.yale.edu

                - Date: 2012-08-24 09:50:05
                  399

                  Intro Previous results H-Contractibility on chordal graphs Conclusion and open problems Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths R´emy Belmonte1 Joint work with Petr A. Golovach2 , P

                  Add to Reading List

                  Source URL: rutcor.rutgers.edu

                  - Date: 2012-01-04 05:35:05
                    400

                    3-coloring planar graphs with four triangles ˇ Dvoˇrák, Alexandr V. Kostochka, Oleg V. Borodin, Zdenek Bernard Lidický, Matthew Yancey Sobolev Institute of Mathematics and Novosibirsk State University Charles Univers

                    Add to Reading List

                    Source URL: orion.math.iastate.edu

                    - Date: 2014-08-22 14:45:34
                      UPDATE