The Number of Graphs Not Containing K3, 3 as a Minor
暂无分享,去创建一个
Marc Noy | Stefanie Gerke | Andreas Weißl | Omer Giménez | Omer Giménez | M. Noy | S. Gerke | A. Weißl
[1] Marc Noy,et al. Enumeration and limit laws for series-parallel graphs , 2007, Eur. J. Comb..
[2] W. T. Tutte,et al. A Census of Planar Triangulations , 1962, Canadian Journal of Mathematics.
[3] Colin McDiarmid,et al. Random cubic planar graphs , 2007, Random Struct. Algorithms.
[4] R. Mullin,et al. The enumeration of c-nets via quadrangulations , 1968 .
[5] Frank Harary,et al. Graphical enumeration , 1973 .
[6] Edward Allburn,et al. Graph decomposition , 1990 .
[7] C. McDiarmid,et al. Random Graphs from Planar and Other Addable Classes , 2006 .
[8] R. Halin,et al. Über einen Satz von K. Wagner zum Vierfarbenproblem , 1964 .
[9] Paul Wollan,et al. Proper minor-closed families are small , 2006, J. Comb. Theory B.
[10] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .
[11] Omer Giménez,et al. The number of planar graphs and properties of random planar graphs , 2005 .
[12] R. Diestel. Graph Decompositions: A Study in Infinite Graph Theory , 1990 .
[13] C. Kuratowski. Sur le problème des courbes gauches en Topologie , 1930 .
[14] Edward A. Bender,et al. The Number of Labeled 2-Connected Planar Graphs , 2002, Electron. J. Comb..
[15] Robin Thomas,et al. Surveys in Combinatorics, 1999: Recent Excluded Minor Theorems for Graphs , 1999 .
[16] Timothy R. S. Walsh,et al. Counting labelled three-connected and homeomorphically irreducible two-connected graphs , 1982, J. Comb. Theory, Ser. B.
[17] Janka Chlebíková,et al. A characterization of some graph classes using excluded minors , 2007, Period. Math. Hung..