Person:394201

Available identifiers

zbMath Open korzhik.vladimir-pMaRDI QIDQ394201

List of research outcomes

Publication	Date of Publication	Type
All 2-planar graphs having the same spanning subgraph	2023-12-11	Paper
A simple proof of the map color theorem for nonorientable surfaces	2022-06-10	Paper
Planar graphs having no proper 2-immersions in the plane. II	2021-07-08	Paper
Planar graphs having no proper 2-immersions in the plane. I	2021-07-08	Paper
Planar graphs having no proper 2-immersions in the plane. III	2021-07-08	Paper
A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s	2021-02-19	Paper
Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs	2015-12-08	Paper
Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs	2015-08-05	Paper
Nonorientable biembeddings of cyclic Steiner triple systems generated by Skolem sequences	2015-04-29	Paper
Proper 1-immersions of graphs triangulating the plane	2014-01-24	Paper
Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph	2013-10-21	Paper
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing	2013-03-07	Paper
On the 1-chromatic number of nonorientable surfaces with large genus	2012-05-04	Paper
Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\)	2010-10-19	Paper
Coloring vertices and faces of maps on surfaces	2010-10-11	Paper
Finite fields and the 1‐chromatic number of orientable surfaces	2010-03-15	Paper
Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments	2009-12-18	Paper
Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs	2009-12-09	Paper
Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)	2009-04-09	Paper
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing	2009-03-03	Paper
Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness	2008-07-11	Paper
Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)	2008-02-11	Paper
A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs	2008-02-11	Paper
Minimal non-1-planar graphs	2008-02-11	Paper
Small surface trades in triangular embeddings	2006-10-30	Paper
On the maximal distance between triangular embeddings of a complete graph.	2006-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q5463542	2005-08-04	Paper
Nonorientable biembeddings of Steiner triple systems	2004-08-19	Paper
Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs	2004-08-06	Paper
Another proof of the map color theorem for nonorientable surfaces.	2003-08-20	Paper
On the minimal nonzero distance between triangular embeddings of a complete graph.	2003-08-19	Paper
On the number of nonisomorphic orientable regular embeddings of complete graphs	2002-12-10	Paper
Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.	2002-12-10	Paper
Nonadditivity of the 1-genus of a graph	2000-11-02	Paper
Triangular embeddings of \(K_n-K_m\) with unboundedly large \(m\)	2000-11-02	Paper
A possibly infinite series of surfaces with known 1-chromatic number	1997-12-03	Paper
A tighter bounding interval for the 1-chromatic number of a surface	1997-10-26	Paper
An infinite series of surfaces with known 1-chromatic number	1997-09-15	Paper
https://portal.mardi4nfdi.de/entity/Q4887821	1997-01-05	Paper
A nonorientable triangular embedding of \(K_ n-K_ 2\), \(n\equiv 8\pmod{12}\)	1995-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4318221	1995-03-23	Paper
A lower bound for the one-chromatic number of a surface	1994-10-10	Paper
Realizing the chromatic numbers of triangulations of surfaces	1994-03-01	Paper
https://portal.mardi4nfdi.de/entity/Q4713918	1992-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q3484862	1986-01-01	Paper

Research outcomes over time

This page was built for person: Vladimir P. Korzhik