Cycles

Results: 3316



#Item
561

Arbitrary orientations of Hamilton cycles in digraphs Amelia Taylor (University of Birmingham) Let n be sufficiently large and suppose that G is a digraph on n vertices where every vertex has in- and outdegree at least n

Add to Reading List

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

- Date: 2014-10-06 04:13:29
    562

    RISK AND BUSINESS CYCLES New and Old Austrian Perspectives Tyler Cowen London and New York -iiiCONTENTS List of figures and tables

    Add to Reading List

    Source URL: www.libertarianismo.org

    Language: English - Date: 2015-10-12 14:46:10
      563

      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
        564

        J. Pure Appl. Algebra (to appear) ACYCLICITY OF TATE CONSTRUCTIONS SRIKANTH IYENGAR Abstract. We prove that a Tate construction Ahu1 , . . . , un | ∂(ui ) = zi i over a DG algebra A, on cycles z1 , . . . , zn in A> 1 ,

        Add to Reading List

        Source URL: www.math.unl.edu

        Language: English - Date: 2005-07-16 16:37:18
          565

          Les CYCLES LONGS sont décrits en page les CYCLES MI-LONGS en page

          Add to Reading List

          Source URL: vent-debout.org

          Language: French - Date: 2015-09-01 11:08:25
            566

            Alberta Worm Invasion: Worm Tracker http://worms.educ.ualberta.ca/ Impacts on Nutrient Cycles Another problem with earthworm invasions is their ability to alter nutrient cycles. Depending on the earthworm species invadin

            Add to Reading List

            Source URL: worms.educ.ualberta.ca

            Language: English - Date: 2014-11-13 16:00:54
              567

              3-choosability of triangle-free planar graphs with constraint on 4-cycles∗ Zdenˇek Dvoˇra´k† Bernard Lidick´ y‡

              Add to Reading List

              Source URL: iti.mff.cuni.cz

              Language: English - Date: 2016-02-04 05:53:37
                568

                3-choosability of planar graphs with (≤ 4)-cycles far apart Zdeněk Dvořák∗ Abstract A graph is k-choosable if it can be colored whenever every vertex

                Add to Reading List

                Source URL: iti.mff.cuni.cz

                Language: English - Date: 2016-02-04 05:53:38
                  569

                  Auditing Hierarchical Cycles to Locate Other Inconsistencies in the UMLS

                  Add to Reading List

                  Source URL: www.ncbi.nlm.nih.gov

                  Language: English
                    570

                    THE GENERIC RIGIDITY OF MINIMAL CYCLES A Dissertation Presented to the Faculty of the Graduate School of Cornell University in Partial Fulfillment of the Requirements for the Degree of

                    Add to Reading List

                    Source URL: www.armadillodanceproject.com

                    Language: English - Date: 2010-10-22 11:09:56
                      UPDATE