default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir P. Korzhik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j40]Vladimir P. Korzhik:
All 2-planar graphs having the same spanning subgraph. Art Discret. Appl. Math. 7(1): 1 (2023)- 2022
- [j39]Vladimir P. Korzhik:
A simple proof of the Map Color Theorem for nonorientable surfaces. J. Comb. Theory B 156: 1-17 (2022) - 2021
- [j38]Vladimir P. Korzhik:
A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s. Art Discret. Appl. Math. 4(1) (2021) - [j37]Vladimir P. Korzhik
:
Planar graphs having no proper 2-immersions in the plane. II. Discret. Math. 344(9): 112481 (2021) - [j36]Vladimir P. Korzhik:
Planar graphs having no proper 2-immersions in the plane. I. Discret. Math. 344(9): 112482 (2021) - [j35]Vladimir P. Korzhik:
Planar graphs having no proper 2-immersions in the plane. III. Discret. Math. 344(9): 112516 (2021)
2010 – 2019
- 2016
- [j34]Vladimir P. Korzhik:
Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs. Discret. Math. 339(2): 712-720 (2016) - 2015
- [j33]Vladimir P. Korzhik:
Nonorientable biembeddings of cyclic Steiner triple systems generated by Skolem sequences. Discret. Math. 338(8): 1345-1361 (2015) - [j32]Vladimir P. Korzhik:
Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs. Discret. Math. 338(12): 2186-2196 (2015) - 2013
- [j31]Vladimir P. Korzhik:
Proper 1-immersions of graphs triangulating the plane. Discret. Math. 313(23): 2673-2686 (2013) - [j30]Vladimir P. Korzhik, Bojan Mohar:
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. J. Graph Theory 72(1): 30-71 (2013) - [j29]Vladimir P. Korzhik:
Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph. J. Graph Theory 74(2): 133-142 (2013) - 2012
- [j28]Vladimir P. Korzhik:
On the 1-chromatic number of nonorientable surfaces with large genus. J. Comb. Theory B 102(2): 283-328 (2012) - 2010
- [j27]Vladimir P. Korzhik:
Coloring vertices and faces of maps on surfaces. Discret. Math. 310(19): 2504-2509 (2010) - [j26]Vladimir P. Korzhik:
Exponentially many nonisomorphic genus embeddings of Kn, m. Discret. Math. 310(21): 2919-2924 (2010) - [j25]Vladimir P. Korzhik:
Finite fields and the 1-chromatic number of orientable surfaces. J. Graph Theory 63(3): 179-184 (2010)
2000 – 2009
- 2009
- [j24]Vladimir P. Korzhik:
Exponentially many nonisomorphic orientable triangular embeddings of K12s+3. Discret. Math. 309(4): 852-866 (2009) - [j23]Mike J. Grannell, Vladimir P. Korzhik:
Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs. Discret. Math. 309(9): 2847-2860 (2009) - [j22]Vladimir P. Korzhik:
Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments. J. Graph Theory 61(4): 324-334 (2009) - 2008
- [j21]Vladimir P. Korzhik:
Exponentially many nonisomorphic orientable triangular embeddings of K12s. Discret. Math. 308(7): 1046-1071 (2008) - [j20]Vladimir P. Korzhik, Jin Ho Kwak:
A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs. Discret. Math. 308(7): 1072-1079 (2008) - [j19]Vladimir P. Korzhik:
Minimal non-1-planar graphs. Discret. Math. 308(7): 1319-1327 (2008) - [j18]Vladimir P. Korzhik, Jin Ho Kwak:
Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness. Discret. Math. 308(15): 3208-3212 (2008) - [c1]Vladimir P. Korzhik, Bojan Mohar:
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. GD 2008: 302-312 - 2006
- [j17]G. K. Bennett, Mike J. Grannell, Terry S. Griggs, Vladimir P. Korzhik, Jozef Sirán:
Small surface trades in triangular embeddings. Discret. Math. 306(21): 2637-2646 (2006) - [j16]Vladimir P. Korzhik:
On the maximal distance between triangular embeddings of a complete graph. J. Comb. Theory B 96(3): 426-435 (2006) - 2005
- [j15]Valeri B. Alekseyev, Vladimir P. Korzhik:
On the voltage-current transferring in topological graph theory. Ars Comb. 74 (2005) - 2004
- [j14]Mike J. Grannell, Vladimir P. Korzhik:
Nonorientable biembeddings of Steiner triple systems. Discret. Math. 285(1-3): 121-126 (2004) - [j13]Vladimir P. Korzhik, Heinz-Jürgen Voss:
Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs. J. Comb. Theory B 91(2): 253-287 (2004) - 2003
- [j12]Mike J. Grannell, Terry S. Griggs, Vladimir P. Korzhik, Jozef Sirán:
On the minimal nonzero distance between triangular embeddings of a complete graph. Discret. Math. 269(1-3): 149-160 (2003) - 2002
- [j11]Vladimir P. Korzhik, Heinz-Jürgen Voss:
Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of Complete Graphs. J. Comb. Theory B 86(1): 186-211 (2002) - [j10]Vladimir P. Korzhik:
Another Proof of the Map Color Theorem for Nonorientable Surfaces. J. Comb. Theory B 86(2): 221-253 (2002) - 2001
- [j9]Vladimir P. Korzhik, Heinz-Jürgen Voss:
On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs. J. Comb. Theory B 81(1): 58-76 (2001)
1990 – 1999
- 1998
- [j8]Vladimir P. Korzhik:
Nonadditivity of the 1-genus of a graph. Discret. Math. 184(1-3): 253-258 (1998) - [j7]Vladimir P. Korzhik:
Triangular embeddings of Kn-Km with unboundedly large m. Discret. Math. 190(1-3): 149-162 (1998) - [j6]Vladimir P. Korzhik:
An Infinite Series of Surfaces with Known 1-Chromatic Number. J. Comb. Theory B 72(1): 80-90 (1998) - 1997
- [j5]Vladimir P. Korzhik:
A tighter bounding interval for the 1-chromatic number of a surface. Discret. Math. 169(1-3): 95-120 (1997) - [j4]Vladimir P. Korzhik:
A possibly infinite series of surfaces with known 1-chromatic number. Discret. Math. 173(1-3): 137-149 (1997) - 1995
- [j3]Vladimir P. Korzhik:
A nonorientable triangular embedding of Kn-K2, n=8 (mod 12). Discret. Math. 141(1-3): 195-211 (1995) - 1994
- [j2]Vladimir P. Korzhik:
A Lower Bound for the One-Chromatic Number of a Surface. J. Comb. Theory B 61(1): 40-56 (1994) - 1993
- [j1]Frank Harary, Serge Lawrencenko, Vladimir P. Korzhik:
Realizing the chromatic numbers of triangulations of surfaces. Discret. Math. 122(1-3): 197-204 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
