On the genus of the graph Kn × K2 or the n-prism
- 作者Gerhard Ringel
- 卷第20卷
- 印刷ISSN0012-365X
- 文件大小591.07KB
- 发表时间1977
- DOI10.1016/0012-365x(77)90067-x
- 页码287-294
On comparisons of random, partition, and proportional partition testingNtafos, S.C. · 2001
On Random Partitions Induced by Random MapsKrachun, D.; Yakubovich, Yu. · Journal of Mathematical Sciences · 2018
Random walks on random partitions in one dimensionNadler, Walter; Huang, Tsongjy; Stein, D. L. · Physical Review E · 1996
General Partitioning on Random GraphsC.R. Subramanian; C.E. Veni Madhavan · 2002
Random walks on strict partitionsL. Petrov · 2010
On random and partition testingNtafos, Simeon · ACM SIGSOFT Software Engineering Notes · 1998
On random stable partitionsPittel, Boris · International Journal of Game Theory · 2018
PrefaceNaoki Katoh; Toshihide Ibaraki; Andras Recski · 2001
Square grids with long “diagonals”Gaspar, Zsolt; Radics, Norbert; Recski, Andras · Optimization Methods and Software · 1998
On the parametrization of linear memoryless 2-portsAndras Recski; Vilmos Zoller · 1982
Hybrid Description and the Spectrum of Linear MultiportsRecski, Andras · IEEE Transactions on Circuits and Systems II: Express Briefs · 2019
Generalization of the normal tree method for networks without graphic structuresRecski, Andras · IEEE Transactions on Circuits and Systems II: Express Briefs · 2019