We stand with Ukraine  

Vladimir P. Korzhik

Orcid: 0000-0001-8685-5648

According to our database1, Vladimir P. Korzhik authored at least 40 papers between 1993 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
All 2-planar graphs having the same spanning subgraph.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Art Discret. Appl. Math., August, 2023

2022
A simple proof of the Map Color Theorem for nonorientable surfaces.
[BibTeX]
[DOI]
Vladimir P. Korzhik
J. Comb. Theory B, 2022

2021
Planar graphs having no proper 2-immersions in the plane. III.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 2021

Planar graphs having no proper 2-immersions in the plane. I.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 2021

Planar graphs having no proper 2-immersions in the plane. II.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 2021

A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Art Discret. Appl. Math., 2021

2016
Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 2016

2015
Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 2015

Nonorientable biembeddings of cyclic Steiner triple systems generated by Skolem sequences.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 2015

2013
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing.
[BibTeX]
[DOI]
Vladimir P. Korzhik
,
Bojan Mohar
J. Graph Theory, 2013

Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph.
[BibTeX]
[DOI]
Vladimir P. Korzhik
J. Graph Theory, 2013

Proper 1-immersions of graphs triangulating the plane.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 2013

2012
On the 1-chromatic number of nonorientable surfaces with large genus.
[BibTeX]
[DOI]
Vladimir P. Korzhik
J. Comb. Theory B, 2012

2010
Finite fields and the 1-chromatic number of orientable surfaces.
[BibTeX]
[DOI]
Vladimir P. Korzhik
J. Graph Theory, 2010

Exponentially many nonisomorphic genus embeddings of K<sub>n, m</sub>.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 2010

Coloring vertices and faces of maps on surfaces.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 2010

2009
Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments.
[BibTeX]
[DOI]
Vladimir P. Korzhik
J. Graph Theory, 2009

Exponentially many nonisomorphic orientable triangular embeddings of K<sub>12s+3</sub>.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 2009

Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs.
[BibTeX]
[DOI]
Mike J. Grannell
,
Vladimir P. Korzhik
Discret. Math., 2009

2008
Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness.
[BibTeX]
[DOI]
Vladimir P. Korzhik
,
Jin Ho Kwak
Discret. Math., 2008

A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs.
[BibTeX]
[DOI]
Vladimir P. Korzhik
,
Jin Ho Kwak
Discret. Math., 2008

Minimal non-1-planar graphs.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 2008

Exponentially many nonisomorphic orientable triangular embeddings of K<sub>12s</sub>.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 2008

2006
On the maximal distance between triangular embeddings of a complete graph.
[BibTeX]
[DOI]
Vladimir P. Korzhik
J. Comb. Theory B, 2006

Small surface trades in triangular embeddings.
[BibTeX]
[DOI]
G. K. Bennett
,
Mike J. Grannell
,
Terry S. Griggs
,
Vladimir P. Korzhik
,
Jozef Sirán
Discret. Math., 2006

2005
On the voltage-current transferring in topological graph theory.
[BibTeX]
Valeri B. Alekseyev
,
Vladimir P. Korzhik
Ars Comb., 2005

2004
Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs.
[BibTeX]
[DOI]
Vladimir P. Korzhik
,
Heinz-Jürgen Voss
J. Comb. Theory B, 2004

Nonorientable biembeddings of Steiner triple systems.
[BibTeX]
[DOI]
Mike J. Grannell
,
Vladimir P. Korzhik
Discret. Math., 2004

2003
On the minimal nonzero distance between triangular embeddings of a complete graph.
[BibTeX]
[DOI]
Mike J. Grannell
,
Terry S. Griggs
,
Vladimir P. Korzhik
,
Jozef Sirán
Discret. Math., 2003

2002
Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of Complete Graphs.
[BibTeX]
[DOI]
Vladimir P. Korzhik
,
Heinz-Jürgen Voss
J. Comb. Theory B, 2002

Another Proof of the Map Color Theorem for Nonorientable Surfaces.
[BibTeX]
[DOI]
Vladimir P. Korzhik
J. Comb. Theory B, 2002

2001
On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs.
[BibTeX]
[DOI]
Vladimir P. Korzhik
,
Heinz-Jürgen Voss
J. Comb. Theory B, 2001

1998
An Infinite Series of Surfaces with Known 1-Chromatic Number.
[BibTeX]
[DOI]
Vladimir P. Korzhik
J. Comb. Theory B, 1998

Triangular embeddings of K<sub>n</sub>-K<sub>m</sub> with unboundedly large m.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 1998

Nonadditivity of the 1-genus of a graph.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 1998

1997
A tighter bounding interval for the 1-chromatic number of a surface.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 1997

A possibly infinite series of surfaces with known 1-chromatic number.
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 1997

1995
A nonorientable triangular embedding of K<sub>n</sub>-K<sub>2</sub>, n=8 (mod 12).
[BibTeX]
[DOI]
Vladimir P. Korzhik
Discret. Math., 1995

1994
A Lower Bound for the One-Chromatic Number of a Surface.
[BibTeX]
[DOI]
Vladimir P. Korzhik
J. Comb. Theory B, 1994

1993
Realizing the chromatic numbers of triangulations of surfaces.
[BibTeX]
[DOI]
Frank Harary
,
Serge Lawrencenko
,
Vladimir P. Korzhik
Discret. Math., 1993


  Loading...