The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Vladimir P. Korzhik: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Valeri B. Alekseyev, Vladimir P. Korzhik
    On the voltage-current transferring in topological graph theory. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:74, n:, pp:- [Journal]
  2. Mike J. Grannell, Terry S. Griggs, Vladimir P. Korzhik, Jozef Sirán
    On the minimal nonzero distance between triangular embeddings of a complete graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:149-160 [Journal]
  3. Mike J. Grannell, Vladimir P. Korzhik
    Nonorientable biembeddings of Steiner triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:121-126 [Journal]
  4. G. K. Bennett, Mike J. Grannell, Terry S. Griggs, Vladimir P. Korzhik, Jozef Sirán
    Small surface trades in triangular embeddings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:21, pp:2637-2646 [Journal]
  5. Vladimir P. Korzhik
    Another Proof of the Map Color Theorem for Nonorientable Surfaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:2, pp:221-253 [Journal]
  6. Vladimir P. Korzhik
    A Lower Bound for the One-Chromatic Number of a Surface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:61, n:1, pp:40-56 [Journal]
  7. Vladimir P. Korzhik
    An Infinite Series of Surfaces with Known 1-Chromatic Number. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:72, n:1, pp:80-90 [Journal]
  8. Vladimir P. Korzhik, Heinz-Jürgen Voss
    On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:81, n:1, pp:58-76 [Journal]
  9. Vladimir P. Korzhik, Heinz-Jürgen Voss
    Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of Complete Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:1, pp:186-211 [Journal]
  10. Vladimir P. Korzhik, Heinz-Jürgen Voss
    Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:2, pp:253-287 [Journal]
  11. Vladimir P. Korzhik
    On the maximal distance between triangular embeddings of a complete graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:426-435 [Journal]
  12. Vladimir P. Korzhik
    Nonadditivity of the 1-genus of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:184, n:1-3, pp:253-258 [Journal]
  13. Vladimir P. Korzhik
    Triangular embeddings of Kn-Km with unboundedly large m. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:190, n:1-3, pp:149-162 [Journal]
  14. Vladimir P. Korzhik
    A possibly infinite series of surfaces with known 1-chromatic number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:173, n:1-3, pp:137-149 [Journal]
  15. Vladimir P. Korzhik
    A tighter bounding interval for the 1-chromatic number of a surface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:169, n:1-3, pp:95-120 [Journal]
  16. Vladimir P. Korzhik
    A nonorientable triangular embedding of Kn-K2, n=8 (mod 12). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:195-211 [Journal]
  17. Frank Harary, Serge Lawrencenko, Vladimir P. Korzhik
    Realizing the chromatic numbers of triangulations of surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:197-204 [Journal]

  18. Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. [Citation Graph (, )][DBLP]


  19. Minimal non-1-planar graphs. [Citation Graph (, )][DBLP]


  20. Exponentially many nonisomorphic orientable triangular embeddings of K12s. [Citation Graph (, )][DBLP]


  21. A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs. [Citation Graph (, )][DBLP]


  22. Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness. [Citation Graph (, )][DBLP]


  23. Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs. [Citation Graph (, )][DBLP]


  24. Exponentially many nonisomorphic orientable triangular embeddings of K12s+3. [Citation Graph (, )][DBLP]


  25. Exponentially many nonisomorphic genus embeddings of Kn, m. [Citation Graph (, )][DBLP]


  26. Coloring vertices and faces of maps on surfaces. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002