| Minimal obstructions for 1‐immersions and hardness of 1‐planarity testing VP Korzhik, B Mohar Journal of Graph Theory 72 (1), 30-71, 2013 | 126 | 2013 |
| On the number of nonisomorphic orientable regular embeddings of complete graphs VP Korzhik, HJ Voss Journal of Combinatorial Theory, Series B 81 (1), 58-76, 2001 | 61 | 2001 |
| Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs VP Korzhik, HJ Voss Journal of Combinatorial Theory, Series B 86 (1), 186-211, 2002 | 51 | 2002 |
| Minimal non-1-planar graphs VP Korzhik Discrete Mathematics 308 (7), 1319-1327, 2008 | 48 | 2008 |
| Minimal obstructions for 1-immersions and hardness of 1-planarity testing VP Korzhik, B Mohar International Symposium on Graph Drawing, 302-312, 2008 | 34 | 2008 |
| Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs VP Korzhik, HJ Voss Journal of Combinatorial Theory, Series B 91 (2), 253-287, 2004 | 31 | 2004 |
| Nonorientable biembeddings of Steiner triple systems MJ Grannell, VP Korzhik Discrete mathematics 285 (1-3), 121-126, 2004 | 24 | 2004 |
| Exponentially many nonisomorphic orientable triangular embeddings of K12s VP Korzhik Discrete mathematics 308 (7), 1046-1071, 2008 | 23 | 2008 |
| Realizing the chromatic numbers of triangulations of surfaces F Harary, S Lawrencenko, V Korzhik Discrete mathematics 122 (1-3), 197-204, 1993 | 13 | 1993 |
| Generating nonisomorphic quadrangular embeddings of a complete graph VP Korzhik Journal of Graph Theory 74 (2), 133-142, 2013 | 8 | 2013 |
| Triangular embeddings of Kn− Km with unboundedly large m VP Korzhik Discrete mathematics 190 (1-3), 149-162, 1998 | 8 | 1998 |
| A lower bound for the one-chromatic number of a surface VP Korzhik Journal of Combinatorial Theory, Series B 61 (1), 40-56, 1994 | 8 | 1994 |
| Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs MJ Grannell, VP Korzhik Discrete mathematics 309 (9), 2847-2860, 2009 | 7 | 2009 |
| Another proof of the Map Color Theorem for nonorientable surfaces VP Korzhik Journal of Combinatorial Theory, Series B 86 (2), 221-253, 2002 | 7 | 2002 |
| Proper 1-immersions of graphs triangulating the plane VP Korzhik Discrete Mathematics 313 (23), 2673-2686, 2013 | 6 | 2013 |
| On the minimal nonzero distance between triangular embeddings of a complete graph MJ Grannell, TS Griggs, VP Korzhik, J Širáň Discrete mathematics 269 (1-3), 149-160, 2003 | 5 | 2003 |
| A nonorientable triangular embedding of Kn− K2, n≡ 8 (mod 12) VP Korzhik Discrete mathematics 141 (1-3), 195-211, 1995 | 5 | 1995 |
| Planar graphs having no proper 2-immersions in the plane. II VP Korzhik Discrete Mathematics 344 (9), 112481, 2021 | 4 | 2021 |
| Planar graphs having no proper 2-immersions in the plane. I VP Korzhik Discrete Mathematics 344 (9), 112482, 2021 | 4 | 2021 |
| Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs VP Korzhik Discrete Mathematics 338 (12), 2186-2196, 2015 | 4 | 2015 |
Bojan MoharSimon Fraser University and IMFM在 sfu.ca 的电子邮件经过验证
