1![NAMN PÅ STADEN (=TIMES, fet, storlek 14) NAMN PÅ STADEN (=TIMES, fet, storlek 14)](https://www.pdfsearch.io/img/3c7923ab59f66d45b1ca82dd34f604e3.jpg) | Add to Reading ListSource URL: liveatlund.lu.seLanguage: Swedish - Date: 2016-04-08 07:01:16
|
---|
2![Dr Katherine Staden Address Mathematics Institute University of Warwick Coventry CV4 7AL Dr Katherine Staden Address Mathematics Institute University of Warwick Coventry CV4 7AL](https://www.pdfsearch.io/img/cf726dc92d62e79a85703e359ff4925c.jpg) | Add to Reading ListSource URL: www.klstaden.site11.comLanguage: English - Date: 2015-07-19 17:16:09
|
---|
3![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. 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.](https://www.pdfsearch.io/img/7a089f86a56cc5457859872901b0fe2d.jpg) | Add to Reading ListSource URL: web.mat.bham.ac.ukLanguage: English - Date: 2014-11-19 02:19:17
|
---|
4![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 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](https://www.pdfsearch.io/img/b120fc24b073ddae9c25286cd39e3dce.jpg) | Add to Reading ListSource URL: www.klstaden.site11.comLanguage: English - Date: 2013-11-24 17:09:07
|
---|
5![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 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](https://www.pdfsearch.io/img/fa3109d8ab6b28f1e37d1fbc84b89118.jpg) | Add to Reading ListSource URL: www.klstaden.site11.comLanguage: English - Date: 2015-01-14 13:26:17
|
---|
6![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. 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.](https://www.pdfsearch.io/img/48cce2fadb37c41709d73c7b801df6ff.jpg) | Add to Reading ListSource URL: www.klstaden.site11.comLanguage: English - Date: 2014-01-27 15:58:41
|
---|
7![Den 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](https://www.pdfsearch.io/img/b76db4212b64cb3efea4882faee75270.jpg) | Add to Reading ListSource URL: www.jernhusen.seLanguage: Swedish - Date: 2015-06-25 11:09:01
|
---|
8![Enskedetrilogin
Enskedetrilogin I Den sociala staden Enskedetrilogin
Enskedetrilogin I Den sociala staden](https://www.pdfsearch.io/img/8f3afa08b1224a265bc7a6732c7b464b.jpg) | Add to Reading ListSource URL: uu.diva-portal.orgLanguage: Swedish - Date: 2015-06-05 12:09:53
|
---|
9![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 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](https://www.pdfsearch.io/img/8f66f118aa1e8958cc73132fe4919199.jpg) | Add to Reading ListSource URL: web.mat.bham.ac.uk- Date: 2014-11-06 06:41:59
|
---|
10![Den 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](https://www.pdfsearch.io/img/147fc4c29aaa87919556c3d77357a900.jpg) | Add to Reading ListSource URL: www.jernhusen.seLanguage: Swedish - Date: 2014-10-07 07:21:30
|
---|