On a conjecture by B. Grünbaum. - Stanislav Jendrol'; Ernest Jucovic (Discret. Math., 1972)

On a problem of J. Zaks concerning 5-valent 3-connected planar graphs. - Stanislav Jendrol' (Discret. Math., 1984)

On the simplicial 3-polytopes with only two types of edges. - Stanislav Jendrol'; Michal Tkác (Discret. Math., 1984)

On a class of Hamiltonian polytopes. - Stanislav Jendrol'; Peter Mihók (Discret. Math., 1988)

A non-involutory selfduality. - Stanislav Jendrol' (Discret. Math., 1989)

On quadrangular convex 3-polytopes with at most two types of edges. - Stanislav Jendrol'; Ernest Jucovic (Discret. Math., 1989)

Convex 3-polytopes with exactly two types of edges. - Stanislav Jendrol'; Michal Tkác (Discret. Math., 1990)

On face vectors and vertex vectors of convex polyhedra. - Stanislav Jendrol' (Discret. Math., 1993)

Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters. - Stanislav Jendrol'; Peter J. Owens (Discret. Math., 1995)

The irregularity strength of tKp. - Stanislav Jendrol'; Michal Tkác (Discret. Math., 1995)

On some properties of 4-regular plane graphs. - Mirko Hornák; Stanislav Jendrol' (J. Graph Theory, 1995)

The irregularity strength and cost of the union of cliques. - Stanislav Jendrol'; Michal Tkác; Zsolt Tuza (Discret. Math., 1996)

An inequality concerning edges of minor weight in convex 3-polytopes. - Igor Fabrici; Stanislav Jendrol' (Discuss. Math. Graph Theory, 1996)

Unavoidable set of face types for planar maps. - Mirko Hornák; Stanislav Jendrol' (Discuss. Math. Graph Theory, 1996)

On light subgraphs in plane graphs of minimum degree five. - Stanislav Jendrol'; Tomás Madaras (Discuss. Math. Graph Theory, 1996)

On the d-distance face chromatic number of plane graphs. - Mirko Hornák; Stanislav Jendrol' (Discret. Math., 1997)

Exact Numbers of Longest Cycles with Empty Intersection. - Stanislav Jendrol'; Zdzislaw Skupien (Eur. J. Comb., 1997)

Subgraphs with Restricted Degrees of Their Vertices in Planar 3-Connected Graphs. - Igor Fabrici; Stanislav Jendrol' (Graphs Comb., 1997)

Subgraphs with restricted degrees of their vertices in planar graphs. - Igor Fabrici; Stanislav Jendrol' (Discret. Math., 1998)

Triangles with restricted degrees of their boundary vertices in plane triangulations. - Stanislav Jendrol' (Discret. Math., 1999)

On light cycles in plane triangulations. - Stanislav Jendrol'; Tomás Madaras; Roman Soták; Zsolt Tuza (Discret. Math., 1999)

Subgraphs with Restricted Degrees of their Vertices in Large Polyhedral Maps on Compact Two-manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (Eur. J. Comb., 1999)

A Local Property of Large Polyhedral Maps on Compact 2-Dimensional Manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (Graphs Comb., 1999)

On 3-Connected Plane Graphs without Triangular Faces. - Jochen Harant; Stanislav Jendrol'; Michal Tkác (J. Comb. Theory B, 1999)

On a conjecture by Plummer and Toft. - Mirko Hornák; Stanislav Jendrol' (J. Graph Theory, 1999)

On vertex-degree restricted paths in polyhedral graphs. - Igor Fabrici; Erhard Hexel; Stanislav Jendrol'; Hansjoachim Walther (Discret. Math., 2000)

On vertex types and cyclic colourings of 3-connected plane graphs. - Mirko Hornák; Stanislav Jendrol' (Discret. Math., 2000)

A local property of polyhedral maps on compact two-dimensional manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (Discret. Math., 2000)

Light subgraphs of multigraphs embedded in compact 2-manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (Electron. Notes Discret. Math., 2000)

On a Max-min Problem Concerning Weights of Edges. - Stanislav Jendrol'; Ingo Schiermeyer (Comb., 2001)

Local structures in plane maps and distance colourings. - Stanislav Jendrol'; Zdzislaw Skupien (Discret. Math., 2001)

Light subgraphs of multigraphs on compact 2-dimensional manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (Discret. Math., 2001)

On Light Graphs in 3-Connected Plane Graphs Without Triangular or Quadrangular Faces. - Stanislav Jendrol'; Peter J. Owens (Graphs Comb., 2001)

On weights of induced paths and cycles in claw-free and K1, r-free graphs. - Jochen Harant; Margit Voigt; Stanislav Jendrol'; Bert Randerath; Zdenek Ryjácek; Ingo Schiermeyer (J. Graph Theory, 2001)

On graphs whose line graphs have crossing number one. - Stanislav Jendrol'; Marián Klesc (J. Graph Theory, 2001)

Cyclic Chromatic Number of 3-Connected Plane Graphs. - Hikoe Enomoto; Mirko Hornák; Stanislav Jendrol' (SIAM J. Discret. Math., 2001)

Light paths in large polyhedral maps with prescribed minimum degree. - Stanislav Jendrol'; Heinz-Jürgen Voss (Australas. J Comb., 2002)

Light subgraphs of order 4 in large maps of minimum degree 5 on compact 2-manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (Australas. J Comb., 2003)

Erratum. - Stanislav Jendrol'; Peter J. Owens (Graphs Comb., 2003)

Antimagic Labelings of Generalized Petersen Graphs That Are Plane. - Martin Baca; Stanislav Jendrol'; Mirka Miller; Joseph F. Ryan 001 (Ars Comb., 2004)

Light classes of generalized stars in polyhedral maps on surfaces. - Stanislav Jendrol'; Heinz-Jürgen Voss (Discuss. Math. Graph Theory, 2004)

Distance Coloring of the Hexagonal Lattice. - Peter Jacko; Stanislav Jendrol' (Discuss. Math. Graph Theory, 2005)

Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (Eur. J. Comb., 2005)

Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds. - Stanislav Jendrol'; Heinz-Jürgen Voss (J. Comb. Theory B, 2005)

List coloring of Cartesian products of graphs. - Mieczyslaw Borowiecki; Stanislav Jendrol'; Daniel Král; Jozef Miskuf (Discret. Math., 2006)

Rainbowness of cubic plane graphs. - Stanislav Jendrol' (Discret. Math., 2006)

Total edge irregularity strength of trees. - Jaroslav Ivanco; Stanislav Jendrol' (Discuss. Math. Graph Theory, 2006)

On octahedral fulleroids. - Stanislav Jendrol'; Frantisek Kardos (Discret. Appl. Math., 2007)

On irregular total labellings. - Martin Baca; Stanislav Jendrol'; Mirka Miller; Joseph F. Ryan 001 (Discret. Math., 2007)

Independence number and vertex-disjoint cycles. - Yoshimi Egawa; Hikoe Enomoto; Stanislav Jendrol'; Katsuhiro Ota; Ingo Schiermeyer (Discret. Math., 2007)

Preface. - Mirko Hornák; Stanislav Jendrol' (Discret. Math., 2007)

Rainbowness of plane graphs. - Stanislav Jendrol' (Electron. Notes Discret. Math., 2007)

Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs. - Stanislav Jendrol'; Jozef Miskuf; Roman Soták (Electron. Notes Discret. Math., 2007)

On the Existence of Specific Stars in Planar Graphs. - Jochen Harant; Stanislav Jendrol' (Graphs Comb., 2007)

Paths of low weight in planar graphs. - Igor Fabrici; Jochen Harant; Stanislav Jendrol' (Discuss. Math. Graph Theory, 2008)

On long cycles through four prescribed vertices of a polyhedral graph. - Jochen Harant; Stanislav Jendrol'; Hansjoachim Walther (Discuss. Math. Graph Theory, 2008)

Colouring vertices of plane graphs under restrictions given by faces. - Július Czap; Stanislav Jendrol' (Discuss. Math. Graph Theory, 2009)

Rainbow faces in edge-colored plane graphs. - Stanislav Jendrol'; Jozef Miskuf; Roman Soták; Erika Skrabul'áková (J. Graph Theory, 2009)

Matchings and Nonrainbow Colorings. - Zdenek Dvorák 001; Stanislav Jendrol'; Daniel Král; Gyula Pap (SIAM J. Discret. Math., 2009)

Facial parity edge colouring. - Július Czap; Stanislav Jendrol'; Frantisek Kardos (Ars Math. Contemp., 2011)

Parity vertex colouring of plane graphs. - Július Czap; Stanislav Jendrol'; Margit Voigt (Discret. Math., 2011)

Parity vertex colouring of graphs. - Piotr Borowiecki; Kristína Budajová; Stanislav Jendrol'; Stanislav Krajci (Discuss. Math. Graph Theory, 2011)

On strong parity chromatic number. - Július Czap; Stanislav Jendrol'; Frantisek Kardos (Discuss. Math. Graph Theory, 2011)

Looseness of Plane Graphs. - Július Czap; Stanislav Jendrol'; Frantisek Kardos; Jozef Miskuf (Graphs Comb., 2011)

Upper bounds on the sum of powers of the degrees of a simple planar graph. - Jochen Harant; Stanislav Jendrol'; Tomás Madaras (J. Graph Theory, 2011)

Facial non-repetitive edge-coloring of plane graphs. - Frédéric Havet; Stanislav Jendrol'; Roman Soták; Erika Skrabul'áková (J. Graph Theory, 2011)

Facial parity edge colouring of plane pseudographs. - Július Czap; Stanislav Jendrol'; Frantisek Kardos; Roman Soták (Discret. Math., 2012)

Nonrepetitive vertex colorings of graphs. - Jochen Harant; Stanislav Jendrol' (Discret. Math., 2012)

A Dirac theorem for trestles. - Stanislav Jendrol'; Tomás Kaiser; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 2012)

Light subgraphs of graphs embedded in the plane - A survey. - Stanislav Jendrol'; Heinz-Jürgen Voss (Discret. Math., 2013)

On vertices enforcing a Hamiltonian cycle. - Igor Fabrici; Erhard Hexel; Stanislav Jendrol' (Discuss. Math. Graph Theory, 2013)

On maximum weight of a bipartite graph of given order and size. - Mirko Hornák; Stanislav Jendrol'; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2013)

Rainbow numbers for matchings in plane triangulations. - Stanislav Jendrol'; Ingo Schiermeyer; Jianhua Tu (Discret. Math., 2014)

A note on vertex colorings of plane graphs. - Igor Fabrici; Jochen Harant; Stanislav Jendrol'; Roman Soták (Discuss. Math. Graph Theory, 2014)

A note on face coloring entire weightings of plane graphs. - Stanislav Jendrol'; Peter Sugerek (Discuss. Math. Graph Theory, 2014)

Facial edge ranking of plane graphs. - Július Czap; Stanislav Jendrol' (Discret. Appl. Math., 2015)

Unique-maximum edge-colouring of plane graphs with respect to faces. - Igor Fabrici; Stanislav Jendrol'; Michaela Vrbjarová (Discret. Appl. Math., 2015)

Describing short paths in plane graphs of girth at least 5. - Stanislav Jendrol'; Mária Maceková (Discret. Math., 2015)

Note on 3-paths in plane graphs of girth 4. - Stanislav Jendrol'; Mária Maceková; Roman Soták (Discret. Math., 2015)

A Survey of Irregularity Strength. - Martin Baca; Stanislav Jendrol'; Kumarappan Kathiresan; Kadarkarai Muthugurupackiam; Andrea Semanicová-Fenovcíková (Electron. Notes Discret. Math., 2015)

Rainbow Numbers for Cycles in Plane Triangulations. - Mirko Hornák; Stanislav Jendrol'; Ingo Schiermeyer; Roman Soták (J. Graph Theory, 2015)

Facial packing edge-coloring of plane graphs. - Július Czap; Stanislav Jendrol' (Discret. Appl. Math., 2016)

Facial entire colouring of plane graphs. - Igor Fabrici; Stanislav Jendrol'; Michaela Vrbjarová (Discret. Math., 2016)

Facial list colourings of plane graphs. - Igor Fabrici; Stanislav Jendrol'; Margit Voigt (Discret. Math., 2016)

On the maximum weight of a dense connected graph of given order and size. - Mirko Hornák; Stanislav Jendrol'; Ingo Schiermeyer (Discret. Math., 2016)

Optimal unavoidable sets of types of 3-paths for planar graphs of given girth. - Stanislav Jendrol'; Mária Maceková; Mickaël Montassier; Roman Soták (Discret. Math., 2016)

3-path in graphs with bounded average degree. - Stanislav Jendrol'; Mária Maceková; Mickaël Montassier; Roman Soták (Discuss. Math. Graph Theory, 2016)

Maximum edge-colorings of graphs. - Stanislav Jendrol'; Michaela Vrbjarová (Discuss. Math. Graph Theory, 2016)

On Longest Cycles in Essentially 4-connected Planar Graphs. - Jochen Harant; Igor Fabrici; Stanislav Jendrol' (Electron. Notes Discret. Math., 2016)

On the Maximum Weight of a Sparse Connected Graph of Given Order and Size. - Mirko Hornák; Stanislav Jendrol'; Ingo Schiermeyer (Graphs Comb., 2016)

Facial anagram-free edge-coloring of plane graphs. - Július Czap; Stanislav Jendrol'; Roman Soták (Discret. Appl. Math., 2017)

Facially-constrained colorings of plane graphs: A survey. - Július Czap; Stanislav Jendrol' (Discret. Math., 2017)

WORM colorings of planar graphs. - Július Czap; Stanislav Jendrol'; Juraj Valiska (Discuss. Math. Graph Theory, 2017)

Colourings of graphs by labellings. - Martin Baca; Stanislav Jendrol' (Electron. Notes Discret. Math., 2017)

Facial L(2, 1)-edge-labelings of trees. - Július Czap; Stanislav Jendrol'; Juraj Valiska (Discret. Appl. Math., 2018)

Odd connection and odd vertex-connection of graphs. - Christoph Brause; Stanislav Jendrol'; Ingo Schiermeyer (Discret. Math., 2018)

Conflict -free connections of graphs. - Július Czap; Stanislav Jendrol'; Juraj Valiska (Discuss. Math. Graph Theory, 2018)

Graphs with Conflict-Free Connection Number Two. - Hong Chang 002; Trung Duy Doan; Zhong Huang; Stanislav Jendrol'; Xueliang Li 001; Ingo Schiermeyer (Graphs Comb., 2018)

Facial Rainbow Edge-Coloring of Plane Graphs. - Stanislav Jendrol' (Graphs Comb., 2018)

Facial packing vertex-coloring of subdivided plane graphs. - Július Czap; Stanislav Jendrol'; Peter Sugerek; Juraj Valiska (Discret. Appl. Math., 2019)

On rainbow matchings in plane triangulations. - Stanislav Jendrol' (Discret. Math., 2019)

Facial [r.s, t]-colorings of plane graphs. - Július Czap; Stanislav Jendrol'; Peter Sugerek; Juraj Valiska (Discuss. Math. Graph Theory, 2019)

Facial incidence colorings of embedded multigraphs. - Mirko Hornák; Stanislav Jendrol'; Roman Soták (Discuss. Math. Graph Theory, 2019)

Facial rainbow coloring of plane graphs. - Stanislav Jendrol'; Lucia Kekenáková (Discuss. Math. Graph Theory, 2019)

Facial Colorings of Plane Graphs. - Július Czap; Stanislav Jendrol' (J. Interconnect. Networks, 2019)

Edge-coloring of plane multigraphs with many colors on facial cycles. - Július Czap; Stanislav Jendrol'; Juraj Valiska (Discret. Appl. Math., 2020)

Conflict-free vertex-connections of graphs. - Stanislav Jendrol'; Xueliang Li 001; Yaping Mao; Yingying Zhang; Haixing Zhao; Xiaoyu Zhu (Discuss. Math. Graph Theory, 2020)

On Specific Factors in Graphs. - Csilla Bujtás; Stanislav Jendrol'; Zsolt Tuza (Graphs Comb., 2020)

On caterpillar factors in graphs. - Csilla Bujtás; Stanislav Jendrol'; Zsolt Tuza (Theor. Comput. Sci., 2020)

On the cyclic coloring conjecture. - Stanislav Jendrol'; Roman Soták (Discret. Math., 2021)

Colorings of plane graphs without long monochromatic facial paths. - Július Czap; Igor Fabrici; Stanislav Jendrol' (Discuss. Math. Graph Theory, 2021)

A survey on the cyclic coloring and its relaxations. - Július Czap; Mirko Hornák; Stanislav Jendrol' (Discuss. Math. Graph Theory, 2021)

From Colourful to Rainbow Paths in Graphs: Colouring the Vertices. - Christoph Brause; Stanislav Jendrol'; Ingo Schiermeyer (Graphs Comb., 2021)

Graph polynomials and paintability of plane graphs. - Jaroslaw Grytczuk; Stanislav Jendrol'; Mariusz Zajac (Discret. Appl. Math., 2022)

Facial Visibility in Edge Colored Plane Graphs. - Július Czap; Stanislav Jendrol'; Tomás Madaras (Graphs Comb., 2022)

Brooks-type theorem for r-hued coloring of graphs. - Stanislav Jendrol'; Alfred Onderko (Discret. Appl. Math., 2023)

Loose Edge-Connection of Graphs. - Christoph Brause; Stanislav Jendrol'; Ingo Schiermeyer (Graphs Comb., 2023)

2-nearly Platonic graphs. - Stanislav Jendrol' (Discuss. Math. Graph Theory, 2024)

Facial matchings in plane graphs. - Július Czap; Stanislav Jendrol' (Discret. Appl. Math., 2025)

On 𝒫 vertex-connections of graphs. - Július Czap; Stanislav Jendrol'; Peter Sugerek (Discuss. Math. Graph Theory, 2025)

A Note on the Facial Edge-Coloring Conjecture. - Stanislav Jendrol'; Alfred Onderko (Graphs Comb., 2025)