Embedding spanning subgraphs of small bandwidth
暂无分享,去创建一个
[1] János Komlós,et al. Blow-up Lemma , 1997, Combinatorics, Probability and Computing.
[2] Mathias Schacht,et al. Spanning 3-colourable subgraphs of small bandwidth in dense graphs , 2008, J. Comb. Theory, Ser. B.
[3] Andras Hajnal,et al. On the maximal number of independent circuits in a graph , 1963 .
[4] Jfinos Koml s. Proof of the Seymour Conjecture for Large Graphs , 2005 .
[5] János Komlós,et al. Tiling Turán Theorems , 2000, Comb..
[6] E. Szemerédi. Regular Partitions of Graphs , 1975 .
[7] J. Komlos. The Blow-up Lemma , 1999, Combinatorics, Probability and Computing.
[8] Sarmad Abbasi. How Tight Is the Bollobás-Komlós Conjecture? , 2000, Graphs Comb..
[9] G. Dirac. Some Theorems on Abstract Graphs , 1952 .
[10] P. Erdös,et al. On the structure of linear graphs , 1946 .
[11] János Komlós,et al. The Regularity Lemma and Its Applications in Graph Theory , 2000, Theoretical Aspects of Computer Science.
[12] Endre Szemerédi,et al. Proof of the Seymour conjecture for large graphs , 1998 .