Realizing the chromatic numbers of triangulations of surfaces. - Frank Harary; Serge Lawrencenko; Vladimir P. Korzhik (Discret. Math., 1993)

A Lower Bound for the One-Chromatic Number of a Surface. - Vladimir P. Korzhik (J. Comb. Theory B, 1994)

A nonorientable triangular embedding of Kn-K2, n=8 (mod 12). - Vladimir P. Korzhik (Discret. Math., 1995)

A possibly infinite series of surfaces with known 1-chromatic number. - Vladimir P. Korzhik (Discret. Math., 1997)

A tighter bounding interval for the 1-chromatic number of a surface. - Vladimir P. Korzhik (Discret. Math., 1997)

Nonadditivity of the 1-genus of a graph. - Vladimir P. Korzhik (Discret. Math., 1998)

Triangular embeddings of Kn-Km with unboundedly large m. - Vladimir P. Korzhik (Discret. Math., 1998)

An Infinite Series of Surfaces with Known 1-Chromatic Number. - Vladimir P. Korzhik (J. Comb. Theory B, 1998)

On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs. - Vladimir P. Korzhik; Heinz-Jürgen Voss (J. Comb. Theory B, 2001)

Another Proof of the Map Color Theorem for Nonorientable Surfaces. - Vladimir P. Korzhik (J. Comb. Theory B, 2002)

Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of Complete Graphs. - Vladimir P. Korzhik; Heinz-Jürgen Voss (J. Comb. Theory B, 2002)

On the minimal nonzero distance between triangular embeddings of a complete graph. - Mike J. Grannell; Terry S. Griggs; Vladimir P. Korzhik; Jozef Sirán (Discret. Math., 2003)

Nonorientable biembeddings of Steiner triple systems. - Mike J. Grannell; Vladimir P. Korzhik (Discret. Math., 2004)

Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs. - Vladimir P. Korzhik; Heinz-Jürgen Voss (J. Comb. Theory B, 2004)

On the voltage-current transferring in topological graph theory. - Valeri B. Alekseyev; Vladimir P. Korzhik (Ars Comb., 2005)

Small surface trades in triangular embeddings. - G. K. Bennett; Mike J. Grannell; Terry S. Griggs; Vladimir P. Korzhik; Jozef Sirán (Discret. Math., 2006)

On the maximal distance between triangular embeddings of a complete graph. - Vladimir P. Korzhik (J. Comb. Theory B, 2006)

Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. - Vladimir P. Korzhik; Bojan Mohar (GD, 2008)

Exponentially many nonisomorphic orientable triangular embeddings of K12s. - Vladimir P. Korzhik (Discret. Math., 2008)

Minimal non-1-planar graphs. - Vladimir P. Korzhik (Discret. Math., 2008)

A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs. - Vladimir P. Korzhik; Jin Ho Kwak (Discret. Math., 2008)

Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness. - Vladimir P. Korzhik; Jin Ho Kwak (Discret. Math., 2008)

Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs. - Mike J. Grannell; Vladimir P. Korzhik (Discret. Math., 2009)

Exponentially many nonisomorphic orientable triangular embeddings of K12s+3. - Vladimir P. Korzhik (Discret. Math., 2009)

Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments. - Vladimir P. Korzhik (J. Graph Theory, 2009)

Coloring vertices and faces of maps on surfaces. - Vladimir P. Korzhik (Discret. Math., 2010)

Exponentially many nonisomorphic genus embeddings of Kn, m. - Vladimir P. Korzhik (Discret. Math., 2010)

Finite fields and the 1-chromatic number of orientable surfaces. - Vladimir P. Korzhik (J. Graph Theory, 2010)

On the 1-chromatic number of nonorientable surfaces with large genus. - Vladimir P. Korzhik (J. Comb. Theory B, 2012)

Proper 1-immersions of graphs triangulating the plane. - Vladimir P. Korzhik (Discret. Math., 2013)

Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph. - Vladimir P. Korzhik (J. Graph Theory, 2013)

Nonorientable biembeddings of cyclic Steiner triple systems generated by Skolem sequences. - Vladimir P. Korzhik (Discret. Math., 2015)

Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs. - Vladimir P. Korzhik (Discret. Math., 2015)

Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs. - Vladimir P. Korzhik (Discret. Math., 2016)

A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s. - Vladimir P. Korzhik (Art Discret. Appl. Math., 2021)

Planar graphs having no proper 2-immersions in the plane. II. - Vladimir P. Korzhik (Discret. Math., 2021)

Planar graphs having no proper 2-immersions in the plane. I. - Vladimir P. Korzhik (Discret. Math., 2021)

Planar graphs having no proper 2-immersions in the plane. III. - Vladimir P. Korzhik (Discret. Math., 2021)

A simple proof of the Map Color Theorem for nonorientable surfaces. - Vladimir P. Korzhik (J. Comb. Theory B, 2022)

All 2-planar graphs having the same spanning subgraph. - Vladimir P. Korzhik (Art Discret. Appl. Math., 2023)

The number of nonisomorphic nonorientable 6-gonal embeddings of complete graphs. - Vladimir P. Korzhik (Discret. Appl. Math., 2025)