#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1993

2016

- This year (0)
- Last 5 years (6)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Vladimir P. Korzhik, Bojan Mohar
- Journal of Graph Theory
- 2008

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge. A non-1-planar graph G is minimal if the graph G − e is 1-planar for every edge e of G. We construct two infinite families of minimal non-1-planar graphs and show that for every integer n ≥ 63, there are at least 2(n−54)/4 nonisomorphic minimal… (More)

- Vladimir P. Korzhik, Heinz-Jürgen Voss
- J. Comb. Theory, Ser. B
- 2001

- Vladimir P. Korzhik, Heinz-Jürgen Voss
- J. Comb. Theory, Ser. B
- 2004

- Vladimir P. Korzhik
- Discrete Mathematics
- 1998

- Vladimir P. Korzhik
- Discrete Mathematics
- 1995

- Vladimir P. Korzhik, Heinz-Jürgen Voss
- J. Comb. Theory, Ser. B
- 2002

- Vladimir P. Korzhik
- Discrete Mathematics
- 2008

It was proved earlier that there are constants M, c > 0 such that for every n M (resp., every n M , n / ≡ 0, 3mod 12) there are at least c2n/6 nonisomorphic nonorientable (resp., orientable) genus embeddings ofKn. In the present paper we show that for s 6 there are at least 2s−6 nonisomorphic OT-embeddings of K12s . As a byproduct, we give a relatively… (More)

- Vladimir P. Korzhik
- Discrete Mathematics
- 2008

- Mike J. Grannell, Vladimir P. Korzhik
- Discrete Mathematics
- 2004

It is shown that each possible pair of the 80 isomorphism classes of Steiner triple systems of order 15 may be realized as the colour classes of a face 2-colourable triangulation of the complete graph in a non-orientable surface. This supports the conjecture that every pair of STS(n)s, n ≥ 9, can be biembedded in a non-orientable surface. AMS… (More)

- Vladimir P. Korzhik
- J. Comb. Theory, Ser. B
- 1994