Sharp bounds on the size of pairable graphs and pairable bipartite graphs
暂无分享,去创建一个
[1] Komei Fukuda,et al. Antipodal graphs and oriented matroids , 1993, Discret. Math..
[2] László A. Székely,et al. New Tricks for Old Trees: Maps and the Pigeonhole Principle , 1994 .
[3] R. Häggkvist,et al. Bipartite graphs and their applications , 1998 .
[4] Salah Al-Addasi,et al. Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders , 2008, Int. J. Math. Math. Sci..
[5] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .
[6] Zhibo Chen,et al. On k-pairable regular graphs , 2010, Discret. Math..
[7] Zhongyuan Che. On k-pairable graphs from trees , 2007 .
[8] Anton Kotzig,et al. Cross-cloning and antipodal graphs , 1988, Discret. Math..
[9] Zhibo Chen. On k-pairable graphs , 2004, Discret. Math..
[10] Primoz Potocnik,et al. Mobility of vertex-transitive graphs , 2007, Discret. Math..
[11] Henk Jan Veldman,et al. Even graphs , 1986, J. Graph Theory.
[12] W. Imrich,et al. Product Graphs: Structure and Recognition , 2000 .
[13] Demetres Christofides. Pair lengths of product graphs , 2006, Discret. Math..
[14] Zhongyuan Che. Uniquely pairable graphs , 2008, Discret. Math..