Staden

Results: 131



#Item
1NAMN PÅ STADEN (=TIMES, fet, storlek 14)

NAMN PÅ STADEN (=TIMES, fet, storlek 14)

Add to Reading List

Source URL: liveatlund.lu.se

Language: Swedish - Date: 2016-04-08 07:01:16
    2Dr Katherine Staden Address Mathematics Institute University of Warwick Coventry CV4 7AL

    Dr Katherine Staden Address Mathematics Institute University of Warwick Coventry CV4 7AL

    Add to Reading List

    Source URL: www.klstaden.site11.com

    Language: English - Date: 2015-07-19 17:16:09
      3THE ROBUST COMPONENT STRUCTURE OF DENSE REGULAR GRAPHS AND APPLICATIONS ¨ DANIELA KUHN, ALLAN LO, DERYK OSTHUS AND KATHERINE STADEN Abstract. In this paper, we study the large-scale structure of dense regular graphs.

      THE ROBUST COMPONENT STRUCTURE OF DENSE REGULAR GRAPHS AND APPLICATIONS ¨ DANIELA KUHN, ALLAN LO, DERYK OSTHUS AND KATHERINE STADEN Abstract. In this paper, we study the large-scale structure of dense regular graphs.

      Add to Reading List

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

      Language: English - Date: 2014-11-19 02:19:17
        4APPROXIMATE HAMILTON DECOMPOSITIONS OF ROBUSTLY EXPANDING REGULAR DIGRAPHS∗ DERYK OSTHUS AND KATHERINE STADEN† Abstract. We show that every sufficiently large r-regular digraph G which has linear degree and is a robu

        APPROXIMATE HAMILTON DECOMPOSITIONS OF ROBUSTLY EXPANDING REGULAR DIGRAPHS∗ DERYK OSTHUS AND KATHERINE STADEN† Abstract. We show that every sufficiently large r-regular digraph G which has linear degree and is a robu

        Add to Reading List

        Source URL: www.klstaden.site11.com

        Language: English - Date: 2013-11-24 17:09:07
          5ON DEGREE SEQUENCES FORCING THE SQUARE OF A HAMILTON CYCLE KATHERINE STADEN AND ANDREW TREGLOWN Abstract. A famous conjecture of P´ osa from 1962 asserts that every graph on n vertices and with minimum degree at least 2

          ON DEGREE SEQUENCES FORCING THE SQUARE OF A HAMILTON CYCLE KATHERINE STADEN AND ANDREW TREGLOWN Abstract. A famous conjecture of P´ osa from 1962 asserts that every graph on n vertices and with minimum degree at least 2

          Add to Reading List

          Source URL: www.klstaden.site11.com

          Language: English - Date: 2015-01-14 13:26:17
            6THE ROBUST COMPONENT STRUCTURE OF DENSE REGULAR GRAPHS AND APPLICATIONS ¨ DANIELA KUHN, ALLAN LO, DERYK OSTHUS AND KATHERINE STADEN Abstract. In this paper, we study the large-scale structure of dense regular graphs.

            THE ROBUST COMPONENT STRUCTURE OF DENSE REGULAR GRAPHS AND APPLICATIONS ¨ DANIELA KUHN, ALLAN LO, DERYK OSTHUS AND KATHERINE STADEN Abstract. In this paper, we study the large-scale structure of dense regular graphs.

            Add to Reading List

            Source URL: www.klstaden.site11.com

            Language: English - Date: 2014-01-27 15:58:41
              7Den stationsnära staden Jernhusens vision, värden och strategier för stationsnära stad Max 600 meters promenad, annars väljer man bilen

              Den stationsnära staden Jernhusens vision, värden och strategier för stationsnära stad Max 600 meters promenad, annars väljer man bilen

              Add to Reading List

              Source URL: www.jernhusen.se

              Language: Swedish - Date: 2015-06-25 11:09:01
                8Enskedetrilogin Enskedetrilogin I Den sociala staden

                Enskedetrilogin Enskedetrilogin I Den sociala staden

                Add to Reading List

                Source URL: uu.diva-portal.org

                Language: Swedish - Date: 2015-06-05 12:09:53
                  9On degree sequences forcing the square of a Hamilton cycle Katherine Staden (University of Birmingham) Many famous results in extremal graph theory give minimum degree conditions that force some substructure. For example

                  On degree sequences forcing the square of a Hamilton cycle Katherine Staden (University of Birmingham) Many famous results in extremal graph theory give minimum degree conditions that force some substructure. For example

                  Add to Reading List

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

                  - Date: 2014-11-06 06:41:59
                    10Den stationsnära staden Jernhusens vision, värden och strategier för stationsnära stad Max 600 meters promenad, annars väljer man bilen

                    Den stationsnära staden Jernhusens vision, värden och strategier för stationsnära stad Max 600 meters promenad, annars väljer man bilen

                    Add to Reading List

                    Source URL: www.jernhusen.se

                    Language: Swedish - Date: 2014-10-07 07:21:30