Forbidden

Results: 382



#Item
61Michele Mariaud gallery 153 lafayette street, 4th floor new york nywww.michelemariaudgallery.com CLOVIS PAREIKO “…The word “beauty” is almost a forbidden word. But for me, beauty could be an indirect side

Michele Mariaud gallery 153 lafayette street, 4th floor new york nywww.michelemariaudgallery.com CLOVIS PAREIKO “…The word “beauty” is almost a forbidden word. But for me, beauty could be an indirect side

Add to Reading List

Source URL: michelemariaudgallery.com

- Date: 2015-09-08 17:11:59
    62Set families with a forbidden subposet Boris Bukh August 2008 Introduction

    Set families with a forbidden subposet Boris Bukh August 2008 Introduction

    Add to Reading List

    Source URL: www.borisbukh.org

    Language: English - Date: 2012-08-23 17:30:42
      63On Forbidden Subdivision Characterization of Graph Classes Zdenˇek Dvoˇra´k Charles University, Faculty of Mathematics and Physics, Institute for Theoretical Computer Science (ITI) 1 Malostransk´e n´

      On Forbidden Subdivision Characterization of Graph Classes Zdenˇek Dvoˇra´k Charles University, Faculty of Mathematics and Physics, Institute for Theoretical Computer Science (ITI) 1 Malostransk´e n´

      Add to Reading List

      Source URL: iti.mff.cuni.cz

      Language: English - Date: 2016-02-04 05:53:37
        64Edge-closure concept in claw-free graphs and stability of forbidden subgraphs Jan Brousek, Přemysl Holub 1,2

        Edge-closure concept in claw-free graphs and stability of forbidden subgraphs Jan Brousek, Přemysl Holub 1,2

        Add to Reading List

        Source URL: iti.mff.cuni.cz

        Language: English - Date: 2016-02-04 05:53:38
          65Forbidden Graphs for Tree-depth Zdeněk Dvořák Archontia C. Giannopoulou Dimitrios M. Thilikos Abstract For every k ≥ 0, we define Gk as the class of graphs with tree-depth

          Forbidden Graphs for Tree-depth Zdeněk Dvořák Archontia C. Giannopoulou Dimitrios M. Thilikos Abstract For every k ≥ 0, we define Gk as the class of graphs with tree-depth

          Add to Reading List

          Source URL: iti.mff.cuni.cz

          Language: English - Date: 2016-02-04 05:53:37
            66C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/split-vs-set-representation/3-sun-free-split-rootsdvi

            C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/split-vs-set-representation/3-sun-free-split-rootsdvi

            Add to Reading List

            Source URL: www.zaik.uni-koeln.de

            Language: English - Date: 2015-02-02 16:29:21
            67On the structure of oriented graphs and digraphs with forbidden tournaments or cycles Timothy Townsend (University of Birmingham) Motivated by his work on the classification of countable homogeneous oriented graphs, Cher

            On the structure of oriented graphs and digraphs with forbidden tournaments or cycles Timothy Townsend (University of Birmingham) Motivated by his work on the classification of countable homogeneous oriented graphs, Cher

            Add to Reading List

            Source URL: web.mat.bham.ac.uk

            - Date: 2014-11-14 03:36:35
              68On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman and Ondˇrej Pangr´ac Abstract Given a graph G = (V, E), two fixed vertices s, t ∈ V and a set F of pairs of vertices (called forbidden pairs), the probl

              On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman and Ondˇrej Pangr´ac Abstract Given a graph G = (V, E), two fixed vertices s, t ∈ V and a set F of pairs of vertices (called forbidden pairs), the probl

              Add to Reading List

              Source URL: iti.mff.cuni.cz

              Language: English - Date: 2016-02-04 05:53:37
                69FORBIDDEN LIFTS (NP AND CSP FOR COMBINATORISTS) ´ ˇ RIL ˇ GABOR

                FORBIDDEN LIFTS (NP AND CSP FOR COMBINATORISTS) ´ ˇ RIL ˇ GABOR

                Add to Reading List

                Source URL: iti.mff.cuni.cz

                Language: English - Date: 2016-02-04 05:53:37
                  70˝ ERDOS–SZEKERES THEOREM FOR POINT SETS WITH FORBIDDEN SUBCONFIGURATIONS 1

                  ˝ ERDOS–SZEKERES THEOREM FOR POINT SETS WITH FORBIDDEN SUBCONFIGURATIONS 1

                  Add to Reading List

                  Source URL: www.cs.elte.hu

                  Language: English - Date: 2011-06-01 09:18:30