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

Search the dblp DataBase

Title:
Author:
Bojan Mohar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sergio Cabello, Bojan Mohar
    Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:131-142 [Conf]
  2. Bojan Mohar
    Drawing Graphs in the Hyperbolic Plane. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:127-136 [Conf]
  3. Bojan Mohar, Pierre Rosenstiehl
    A Flow Approach to Upward Drawings of Toroidal Maps. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:33-39 [Conf]
  4. Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl
    A spectral approach to bandwidth and separator problems in graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:183-194 [Conf]
  5. Martin Juvan, Joze Marincek, Bojan Mohar
    Embedding Graphs in the Torus in Linear Time. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:360-363 [Conf]
  6. Ken-ichi Kawarabayashi, Bojan Mohar
    Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:401-416 [Conf]
  7. Bojan Mohar
    Embedding Graphs in an Arbitrary Surface in Linear Time. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:392-397 [Conf]
  8. Dan Archdeacon, Nora Hartsfield, C. H. C. Little, Bojan Mohar
    Obstruction Sets for Outer-Projective-Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:49, n:, pp:- [Journal]
  9. Gasper Fijavz, Bojan Mohar
    K6-Minors in Projective Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:3, pp:453-465 [Journal]
  10. Bojan Mohar
    Existence of Polyhedral Embeddings of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:3, pp:395-401 [Journal]
  11. Bojan Mohar
    Hajós Theorem For Colorings Of Edge-Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:25, n:1, pp:65-76 [Journal]
  12. Bojan Mohar
    Uniqueness and Minimality of Large Face-Width Embeddings of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:4, pp:541-556 [Journal]
  13. Bojan Mohar
    Projective Plane and Möbius Band Obstructions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:2, pp:235-266 [Journal]
  14. Martin Juvan, Bojan Mohar, Robin Thomas
    List Edge-Colorings of Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  15. Bojan Mohar, Riste Skrekovski
    Nowhere-zero k-flows of Supergraphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  16. Bojan Mohar, Riste Skrekovski
    The Grötzsch Theorem for the Hypergraph of Maximal Cliques. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  17. Thomas Böhme, Bojan Mohar
    Domination, Packing and Excluded Minors. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  18. Noga Alon, Bojan Mohar
    The Chromatic Number Of Graph Powers. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:1, pp:- [Journal]
  19. Martin Juvan, Bojan Mohar, Riste Skrekovski
    List Total Colourings of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:2, pp:181-188 [Journal]
  20. Bojan Mohar
    Obstructions for the Disk and the Cylinder Embedding Extension Problems. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:375-406 [Journal]
  21. Martin Juvan, Bojan Mohar, Janez Zerovnik
    Distance-related Invariants on Polygraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:80, n:1, pp:57-71 [Journal]
  22. Bojan Mohar
    Bar-Magnet Polyhedra and NS-Orientations of Maps. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:35, n:3, pp:481-491 [Journal]
  23. Bojan Mohar
    Nonorientable Genus of Nearly Complete Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:137-146 [Journal]
  24. Bojan Mohar
    Branced Covering. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:339-348 [Journal]
  25. Bojan Mohar
    Convex Representations of Maps on the Torus and Other Flat Surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:83-95 [Journal]
  26. Bojan Mohar, Pierre Rosenstiehl
    Tessellation and Visibility Representations of Maps on the Torus. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:2, pp:249-263 [Journal]
  27. Gasper Fijavz, Bojan Mohar
    Rigidity and separation indices of Paley graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:289, n:1-3, pp:157-161 [Journal]
  28. Sylvain Gravier, Frédéric Maffray, Bojan Mohar
    On a list-coloring problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:303-308 [Journal]
  29. Sandi Klavzar, Dragan Marusic, Bojan Mohar
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:244, n:1-3, pp:1-4 [Journal]
  30. Joze Marincek, Bojan Mohar
    On approximating the maximum diameter ratio of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:244, n:1-3, pp:323-330 [Journal]
  31. Bojan Mohar
    Coloring Eulerian triangulations of the projective plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:244, n:1-3, pp:339-343 [Journal]
  32. Sandi Klavzar, Dragan Marusic, Bojan Mohar, Tomaz Pisanski
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:299- [Journal]
  33. Bojan Mohar, Richard J. Nowakowski, Douglas B. West
    Research problems from the 5th Slovenian Conference (Bled, 2003). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:650-658 [Journal]
  34. Janez Ales, Bojan Mohar, Tomaz Pisanski
    Heuristic search for Hamilton cycles in cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:303-309 [Journal]
  35. Bostjan Bresar, Sandi Klavzar, Alenka Lipovec, Bojan Mohar
    Cubic inflation, mirror graphs, regular maps, and partial cubes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:1, pp:54-64 [Journal]
  36. Gasper Fijavz, Martin Juvan, Bojan Mohar, Riste Skrekovski
    Planar Graphs Without Cycles of Specific Lengths. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:4, pp:377-388 [Journal]
  37. Martin Juvan, Bojan Mohar
    2-restricted extensions of partial embeddings of graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:3-4, pp:339-375 [Journal]
  38. Bojan Mohar
    Foreword. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:6, pp:761-762 [Journal]
  39. Bojan Mohar
    Foreword. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:3-4, pp:287-288 [Journal]
  40. Bojan Mohar
    Acyclic colorings of locally planar graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:3-4, pp:491-503 [Journal]
  41. Bojan Mohar
    Circle Packings of Maps in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1997, v:18, n:7, pp:785-805 [Journal]
  42. Michael O. Albertson, Bojan Mohar
    Coloring Vertices and Faces of Locally Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:3, pp:289-295 [Journal]
  43. Bojan Mohar
    Projective Planarity in Linear Time. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:3, pp:482-502 [Journal]
  44. Ivan Gutman, Bojan Mohar
    The Quasi-Wiener and the Kirchhoff Indices Coincide. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1996, v:36, n:5, pp:982-985 [Journal]
  45. Martin Juvan, Bojan Mohar
    Bond Contributions to the Wiener Index. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1995, v:35, n:2, pp:217-219 [Journal]
  46. Martin Juvan, Bojan Mohar, Ante Graovac, Sandi Klavzar, Janez Zerovnik
    Fast computation of the Wiener index of fasciagraphs and rotagraphs. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1995, v:35, n:5, pp:834-840 [Journal]
  47. Sandi Klavzar, Ivan Gutman, Bojan Mohar
    Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1995, v:35, n:3, pp:590-593 [Journal]
  48. Bojan Mohar
    Extremal Mono-q-polyhexes. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1994, v:34, n:5, pp:1127-1129 [Journal]
  49. Bojan Mohar, Darko Babic, Nenad Trinajstic
    A novel definition of the Wiener index for trees. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1993, v:33, n:1, pp:153-154 [Journal]
  50. Thomas Böhme, Bojan Mohar
    Labeled K2, t Minors in Plane Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:84, n:2, pp:291-300 [Journal]
  51. Thomas Böhme, John Maharry, Bojan Mohar
    Ka, k Minors in Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:1, pp:133-147 [Journal]
  52. Thomas Böhme, Bojan Mohar, Carsten Thomassen
    Long Cycles in Graphs on a Fixed Surface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:85, n:2, pp:338-347 [Journal]
  53. Richard Brunet, Bojan Mohar, R. Bruce Richter
    Separating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:201-231 [Journal]
  54. Steve Fisk, Bojan Mohar
    Coloring Graphs without Short Non-bounding Cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:60, n:2, pp:268-276 [Journal]
  55. Martin Juvan, Aleksander Malnic, Bojan Mohar
    Systems of Curves on Surfaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:68, n:1, pp:7-22 [Journal]
  56. Aleksander Malnic, Bojan Mohar
    Generating locally cyclic triangulations of surfaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:56, n:2, pp:147-164 [Journal]
  57. Bojan Mohar
    Face Covers and the Genus Problem for Apex Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:1, pp:102-117 [Journal]
  58. Bojan Mohar
    A common cover of graphs and 2-cell embeddings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:1, pp:94-106 [Journal]
  59. Bojan Mohar
    The enumeration of akempic triangulations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:1, pp:14-23 [Journal]
  60. Bojan Mohar
    Simplicial schemes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:1, pp:68-86 [Journal]
  61. Bojan Mohar
    Embeddings of infinite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:1, pp:29-43 [Journal]
  62. Bojan Mohar
    Isoperimetric numbers of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:3, pp:274-291 [Journal]
  63. Bojan Mohar, Neil Robertson
    Flexibility of Polyhedral Embeddings of Graphs in Surfaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:1, pp:38-57 [Journal]
  64. Bojan Mohar, Neil Robertson
    Planar Graphs on Nonplanar Surfaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:68, n:1, pp:87-111 [Journal]
  65. Bojan Mohar, Neil Robertson
    Disjoint Essential Cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:68, n:2, pp:324-349 [Journal]
  66. Bojan Mohar, Paul D. Seymour
    Coloring Locally Bipartite Graphs on Surfaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:84, n:2, pp:301-310 [Journal]
  67. Bojan Mohar, Alexander Schrijver
    Blocking nonorientability of a surface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:1, pp:2-16 [Journal]
  68. Bojan Mohar, John Shawe-Taylor
    Distance-biregular graphs with 2-valent vertices and distance-regular line graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:193-203 [Journal]
  69. Bojan Mohar
    Tree amalgamation of graphs and tessellations of the Cantor sphere. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:5, pp:740-753 [Journal]
  70. Tomás Feder, Pavol Hell, Bojan Mohar
    Acyclic Homomorphisms and Circular Colorings of Digraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:17, n:1, pp:161-169 [Journal]
  71. Martin Juvan, Bojan Mohar
    Obstructions For 2-Möbius Band Embedding Extension Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:1, pp:57-72 [Journal]
  72. Bojan Mohar
    A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:1, pp:6-26 [Journal]
  73. Sandi Klavzar, Bojan Mohar
    Crossing numbers of Sierpinski-like graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:3, pp:186-198 [Journal]
  74. Drago Bokal, Gasper Fijavz, Martin Juvan, P. Mark Kayll, Bojan Mohar
    The circular chromatic number of a digraph. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:3, pp:227-240 [Journal]
  75. Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz
    Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:45, n:4, pp:270-274 [Journal]
  76. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar
    Approximation algorithms via contraction decomposition. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:278-287 [Conf]
  77. Sergio Cabello, Bojan Mohar
    Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:2, pp:213-235 [Journal]
  78. Bojan Mohar
    Akempic triangulations with 4 odd vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:23-29 [Journal]
  79. Bojan Mohar, Tomaz Pisanski, Martin Skoviera, Arthur White
    The cartesian product of three triangles can be embedded into a surface of genus 7. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:56, n:1, pp:87-89 [Journal]
  80. Bojan Mohar
    On the cycle space of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:1, pp:79-80 [Journal]
  81. Bojan Mohar
    An obstruction to embedding graphs in surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:78, n:1-2, pp:135-142 [Journal]
  82. Dragan Marusic, Bojan Mohar
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:182, n:1-3, pp:1- [Journal]
  83. Bojan Mohar
    On the orientable genus of graphs with bounded nonorientable genus. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:182, n:1-3, pp:245-253 [Journal]
  84. D. Klabjan, Bojan Mohar
    The number of matchings of low order in hexagonal systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:186, n:1-3, pp:167-175 [Journal]
  85. Martin Juvan, Bojan Mohar, Riste Skrekovski
    On list edge-colorings of subcubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:187, n:1-3, pp:137-149 [Journal]
  86. Bojan Mohar
    Apex graphs with embeddings of face-width three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:176, n:1-3, pp:203-210 [Journal]
  87. Bojan Mohar
    Some relations between analytic and geometric properties of infinite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:95, n:1-3, pp:193-219 [Journal]
  88. Bojan Mohar
    Laplace eigenvalues of graphs - a survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:109, n:1-3, pp:171-183 [Journal]
  89. Bojan Mohar
    7-critical graphs of bounded genus. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:112, n:1-3, pp:279-281 [Journal]
  90. Bojan Mohar
    A polynomial time circle packing algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:117, n:1-3, pp:257-263 [Journal]
  91. Bojan Mohar, Neil Robertson, Richard P. Vitray
    Planar graphs on the projective plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:141-157 [Journal]
  92. Bojan Mohar
    Straight-line representations of maps on the torus and other flat surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:155, n:1-3, pp:173-181 [Journal]
  93. Vladimir Batagelj, Dragan Marusic, Bojan Mohar, Tomaz Pisanski
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:134, n:1-3, pp:1- [Journal]
  94. Steve Fisk, Bojan Mohar
    Surface triangulations with isometric boundary. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:134, n:1-3, pp:49-62 [Journal]
  95. Sandi Klavzar, Bojan Mohar
    The chromatic numbers of graph bundles over cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:301-314 [Journal]
  96. Ken-ichi Kawarabayashi, Bojan Mohar
    A relaxed Hadwiger's Conjecture for list colorings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:4, pp:647-651 [Journal]

  97. Improved upper bounds on the crossing number. [Citation Graph (, )][DBLP]


  98. Adding one edge to planar graphs makes crossing number hard. [Citation Graph (, )][DBLP]


  99. Linkless and flat embeddings in 3-space and the unknot problem. [Citation Graph (, )][DBLP]


  100. Homotopic spanners. [Citation Graph (, )][DBLP]


  101. A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. [Citation Graph (, )][DBLP]


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


  103. Crossing and Weighted Crossing Number of Near-Planar Graphs. [Citation Graph (, )][DBLP]


  104. Do We Really Understand the Crossing Numbers? [Citation Graph (, )][DBLP]


  105. Finding one tight cycle. [Citation Graph (, )][DBLP]


  106. List-color-critical graphs on a fixed surface. [Citation Graph (, )][DBLP]


  107. Graph and map isomorphism and all polyhedral embeddings in linear time. [Citation Graph (, )][DBLP]


  108. Triangulations and the Hajós Conjecture. [Citation Graph (, )][DBLP]


  109. Graphs on Surfaces and Their Applications, by Sergei K. Lando and Alexander K. Zvonkin, Encyclopaedia of Mathematical Sciences 141, Springer-Verlag, 2004. [Citation Graph (, )][DBLP]


  110. On Polyhedral Embeddings of Cubic Graphs. [Citation Graph (, )][DBLP]


  111. Optimal linear labelings and eigenvalues of graphs. [Citation Graph (, )][DBLP]


  112. A domain monotonicity theorem for graphs and Hamiltonicity. [Citation Graph (, )][DBLP]


  113. Simplices and Spectra of Graphs. [Citation Graph (, )][DBLP]


  114. Preface. [Citation Graph (, )][DBLP]


  115. Strong embeddings of minimum genus. [Citation Graph (, )][DBLP]


  116. Labeling planar graphs with a condition at distance two. [Citation Graph (, )][DBLP]


Search in 0.082secs, Finished in 0.086secs
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