The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stanislav Jendrol: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin Baca, Stanislav Jendrol, Mirka Miller, Joseph F. Ryan
    Antimagic Labelings of Generalized Petersen Graphs That Are Plane. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:73, n:, pp:- [Journal]
  2. Stanislav Jendrol, Ingo Schiermeyer
    On a Max-min Problem Concerning Weights of Edges. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:3, pp:351-359 [Journal]
  3. Igor Fabrici, Erhard Hexel, Stanislav Jendrol, Hansjoachim Walther
    On vertex-degree restricted paths in polyhedral graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:61-73 [Journal]
  4. Mirko Hornák, Stanislav Jendrol
    On vertex types and cyclic colourings of 3-connected plane graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:101-109 [Journal]
  5. Mirko Hornák, Stanislav Jendrol
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:1-0 [Journal]
  6. Mirko Hornák, Stanislav Jendrol
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:1-2, pp:1-0 [Journal]
  7. Stanislav Jendrol, Zdzislaw Skupien
    Local structures in plane maps and distance colourings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:167-177 [Journal]
  8. Stanislav Jendrol, Heinz-Jürgen Voss
    A local property of polyhedral maps on compact two-dimensional manifolds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:111-120 [Journal]
  9. Stanislav Jendrol, Heinz-Jürgen Voss
    Light subgraphs of multigraphs on compact 2-dimensional manifolds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:329-351 [Journal]
  10. Mieczyslaw Borowiecki, Stanislav Jendrol, Daniel Král, Jozef Miskuf
    List coloring of Cartesian products of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:1955-1958 [Journal]
  11. Stanislav Jendrol
    Rainbowness of cubic plane graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:24, pp:3321-3326 [Journal]
  12. Mirko Hornák, Stanislav Jendrol
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:787- [Journal]
  13. Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol, Katsuhiro Ota, Ingo Schiermeyer
    Independence number and vertex-disjoint cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1493-1498 [Journal]
  14. Martin Baca, Stanislav Jendrol, Mirka Miller, Joseph F. Ryan
    On irregular total labellings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1378-1388 [Journal]
  15. Stanislav Jendrol, Zdzislaw Skupien
    Exact Numbers of Longest Cycles with Empty Intersection. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1997, v:18, n:5, pp:575-578 [Journal]
  16. Stanislav Jendrol, Heinz-Jürgen Voss
    Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:3-4, pp:457-471 [Journal]
  17. Stanislav Jendrol, Heinz-Jürgen Voss
    Subgraphs with Restricted Degrees of their Vertices in Large Polyhedral Maps on Compact Two-manifolds. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:8, pp:821-832 [Journal]
  18. Stanislav Jendrol, Peter J. Owens
    On Light Graphs in 3-Connected Plane Graphs Without Triangular or Quadrangular Faces. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:4, pp:659-680 [Journal]
  19. Stanislav Jendrol, Peter J. Owens
    Erratum. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:4, pp:517-518 [Journal]
  20. Jochen Harant, Stanislav Jendrol, Michal Tkác
    On 3-Connected Plane Graphs without Triangular Faces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:77, n:1, pp:150-161 [Journal]
  21. Stanislav Jendrol, Heinz-Jürgen Voss
    Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:93, n:1, pp:1-21 [Journal]
  22. Hikoe Enomoto, Mirko Hornák, Stanislav Jendrol
    Cyclic Chromatic Number of 3-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:1, pp:121-137 [Journal]
  23. Stanislav Jendrol, Frantisek Kardos
    On octahedral fulleroids. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2181-2186 [Journal]
  24. Stanislav Jendrol, Michal Tkác
    On the simplicial 3-polytopes with only two types of edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:48, n:2-3, pp:229-241 [Journal]
  25. Stanislav Jendrol
    On a problem of J. Zaks concerning 5-valent 3-connected planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:50, n:, pp:231-237 [Journal]
  26. Stanislav Jendrol, Peter Mihók
    On a class of Hamiltonian polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:71, n:3, pp:233-241 [Journal]
  27. Stanislav Jendrol
    A non-involutory selfduality. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:3, pp:325-326 [Journal]
  28. Stanislav Jendrol, Ernest Jucovic
    On quadrangular convex 3-polytopes with at most two types of edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:78, n:3, pp:297-305 [Journal]
  29. Igor Fabrici, Stanislav Jendrol
    Subgraphs with restricted degrees of their vertices in planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:83-90 [Journal]
  30. Stanislav Jendrol
    Triangles with restricted degrees of their boundary vertices in plane triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:196, n:1-3, pp:177-196 [Journal]
  31. Stanislav Jendrol, Tomás Madaras, Roman Sotak, Zsolt Tuza
    On light cycles in plane triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:453-467 [Journal]
  32. Mirko Hornák, Stanislav Jendrol
    On the d-distance face chromatic number of plane graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:171-174 [Journal]
  33. Stanislav Jendrol, Michal Tkác
    Convex 3-polytopes with exactly two types of edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:2, pp:143-160 [Journal]
  34. Stanislav Jendrol
    On face vectors and vertex vectors of convex polyhedra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:118, n:1-3, pp:119-144 [Journal]
  35. Stanislav Jendrol, Michal Tkác
    The irregularity strength of tKp. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:145, n:1-3, pp:301-305 [Journal]
  36. Stanislav Jendrol, Michal Tkác, Zsolt Tuza
    The irregularity strength and cost of the union of cliques. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:179-186 [Journal]
  37. Stanislav Jendrol, Peter J. Owens
    Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:137, n:1-3, pp:251-263 [Journal]

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


  39. Total edge irregularity strength of complete graphs and complete bipartite graphs. [Citation Graph (, )][DBLP]


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


Search in 0.021secs, Finished in 0.023secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002