Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStanislav Jendrol'
Person information
- affiliation: Pavol Jozef Šafárik University, Košice, Slovakia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j125]Stanislav Jendrol'
, Alfred Onderko:
Brooks-type theorem for r-hued coloring of graphs. Discret. Appl. Math. 332: 129-134 (2023)- [j124]Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer:
Loose Edge-Connection of Graphs. Graphs Comb. 39(4): 79 (2023) - 2022
- [j123]Jaroslaw Grytczuk, Stanislav Jendrol', Mariusz Zajac:
Graph polynomials and paintability of plane graphs. Discret. Appl. Math. 313: 71-79 (2022) - [j122]Július Czap, Stanislav Jendrol', Tomás Madaras:
Facial Visibility in Edge Colored Plane Graphs. Graphs Comb. 38(1): 4 (2022) - 2021
- [j121]Stanislav Jendrol', Roman Soták:
On the cyclic coloring conjecture. Discret. Math. 344(2): 112204 (2021) - [j120]Július Czap, Mirko Hornák, Stanislav Jendrol':
A survey on the cyclic coloring and its relaxations. Discuss. Math. Graph Theory 41(1): 5-38 (2021) - [j119]Július Czap, Igor Fabrici, Stanislav Jendrol':
Colorings of plane graphs without long monochromatic facial paths. Discuss. Math. Graph Theory 41(3): 801-808 (2021) - [j118]Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer:
From Colourful to Rainbow Paths in Graphs: Colouring the Vertices. Graphs Comb. 37(5): 1823-1839 (2021) - 2020
- [j117]Július Czap, Stanislav Jendrol', Juraj Valiska:
Edge-coloring of plane multigraphs with many colors on facial cycles. Discret. Appl. Math. 282: 80-85 (2020) - [j116]Stanislav Jendrol', Xueliang Li, Yaping Mao, Yingying Zhang, Haixing Zhao, Xiaoyu Zhu:
Conflict-free vertex-connections of graphs. Discuss. Math. Graph Theory 40(1): 51-65 (2020) - [j115]Csilla Bujtás, Stanislav Jendrol', Zsolt Tuza:
On Specific Factors in Graphs. Graphs Comb. 36(5): 1391-1399 (2020) - [j114]Csilla Bujtás, Stanislav Jendrol', Zsolt Tuza:
On caterpillar factors in graphs. Theor. Comput. Sci. 846: 82-90 (2020)
2010 – 2019
- 2019
- [j113]Július Czap, Stanislav Jendrol', Peter Sugerek, Juraj Valiska:
Facial packing vertex-coloring of subdivided plane graphs. Discret. Appl. Math. 257: 95-100 (2019) - [j112]Stanislav Jendrol':
On rainbow matchings in plane triangulations. Discret. Math. 342(12) (2019) - [j111]Mirko Hornák, Stanislav Jendrol', Roman Soták:
Facial incidence colorings of embedded multigraphs. Discuss. Math. Graph Theory 39(1): 81-93 (2019) - [j110]Július Czap, Stanislav Jendrol', Peter Sugerek, Juraj Valiska:
Facial [r.s, t]-colorings of plane graphs. Discuss. Math. Graph Theory 39(3): 629-645 (2019) - [j109]Stanislav Jendrol', Lucia Kekenáková:
Facial rainbow coloring of plane graphs. Discuss. Math. Graph Theory 39(4): 889-897 (2019) - [j108]Július Czap, Stanislav Jendrol':
Facial Colorings of Plane Graphs. J. Interconnect. Networks 19(1): 1940003:1-1940003:20 (2019) - 2018
- [j107]Július Czap, Stanislav Jendrol', Juraj Valiska:
Facial L(2, 1)-edge-labelings of trees. Discret. Appl. Math. 247: 357-366 (2018) - [j106]Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer:
Odd connection and odd vertex-connection of graphs. Discret. Math. 341(12): 3500-3512 (2018) - [j105]Július Czap, Stanislav Jendrol', Juraj Valiska:
Conflict -free connections of graphs. Discuss. Math. Graph Theory 38(4): 911-920 (2018) - [j104]Stanislav Jendrol':
Facial Rainbow Edge-Coloring of Plane Graphs. Graphs Comb. 34(4): 669-676 (2018) - [j103]Hong Chang, Trung Duy Doan, Zhong Huang, Stanislav Jendrol', Xueliang Li, Ingo Schiermeyer:
Graphs with Conflict-Free Connection Number Two. Graphs Comb. 34(6): 1553-1563 (2018) - 2017
- [j102]Július Czap, Stanislav Jendrol', Roman Soták:
Facial anagram-free edge-coloring of plane graphs. Discret. Appl. Math. 230: 151-155 (2017) - [j101]Július Czap, Stanislav Jendrol':
Facially-constrained colorings of plane graphs: A survey. Discret. Math. 340(11): 2691-2703 (2017) - [j100]Július Czap, Stanislav Jendrol', Juraj Valiska:
WORM colorings of planar graphs. Discuss. Math. Graph Theory 37(2): 353-368 (2017) - [j99]Martin Baca, Stanislav Jendrol':
Colourings of graphs by labellings. Electron. Notes Discret. Math. 60: 25-31 (2017) - 2016
- [j98]Július Czap, Stanislav Jendrol':
Facial packing edge-coloring of plane graphs. Discret. Appl. Math. 213: 71-75 (2016) - [j97]Igor Fabrici, Stanislav Jendrol', Michaela Vrbjarová:
Facial entire colouring of plane graphs. Discret. Math. 339(2): 626-631 (2016) - [j96]Stanislav Jendrol', Mária Maceková, Mickaël Montassier, Roman Soták:
Optimal unavoidable sets of types of 3-paths for planar graphs of given girth. Discret. Math. 339(2): 780-789 (2016) - [j95]Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer:
On the maximum weight of a dense connected graph of given order and size. Discret. Math. 339(7): 1978-1984 (2016) - [j94]Igor Fabrici, Stanislav Jendrol', Margit Voigt:
Facial list colourings of plane graphs. Discret. Math. 339(11): 2826-2831 (2016) - [j93]Stanislav Jendrol', Michaela Vrbjarová:
Maximum edge-colorings of graphs. Discuss. Math. Graph Theory 36(1): 117-125 (2016) - [j92]Stanislav Jendrol', Mária Maceková, Mickaël Montassier, Roman Soták:
3-path in graphs with bounded average degree. Discuss. Math. Graph Theory 36(2): 339-353 (2016) - [j91]Igor Fabrici, Jochen Harant, Stanislav Jendrol':
On longest cycles in essentially 4-connected planar graphs. Discuss. Math. Graph Theory 36(3): 565-575 (2016) - [j90]Jochen Harant, Igor Fabrici, Stanislav Jendrol':
On Longest Cycles in Essentially 4-connected Planar Graphs. Electron. Notes Discret. Math. 55: 143-146 (2016) - [j89]Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer:
On the Maximum Weight of a Sparse Connected Graph of Given Order and Size. Graphs Comb. 32(3): 997-1012 (2016) - 2015
- [j88]Igor Fabrici, Stanislav Jendrol', Michaela Vrbjarová:
Unique-maximum edge-colouring of plane graphs with respect to faces. Discret. Appl. Math. 185: 239-243 (2015) - [j87]Július Czap, Stanislav Jendrol':
Facial edge ranking of plane graphs. Discret. Appl. Math. 194: 60-64 (2015) - [j86]Stanislav Jendrol', Mária Maceková:
Describing short paths in plane graphs of girth at least 5. Discret. Math. 338(2): 149-158 (2015) - [j85]Stanislav Jendrol', Mária Maceková, Roman Soták:
Note on 3-paths in plane graphs of girth 4. Discret. Math. 338(9): 1643-1648 (2015) - [j84]Martin Baca, Stanislav Jendrol', Kumarappan Kathiresan, Kadarkarai Muthugurupackiam, Andrea Semanicová-Fenovcíková:
A Survey of Irregularity Strength. Electron. Notes Discret. Math. 48: 19-26 (2015) - [j83]Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer, Roman Soták:
Rainbow Numbers for Cycles in Plane Triangulations. J. Graph Theory 78(4): 248-257 (2015) - 2014
- [j82]Stanislav Jendrol', Ingo Schiermeyer, Jianhua Tu:
Rainbow numbers for matchings in plane triangulations. Discret. Math. 331: 158-164 (2014) - [j81]Stanislav Jendrol', Peter Sugerek:
A note on face coloring entire weightings of plane graphs. Discuss. Math. Graph Theory 34(2): 421-426 (2014) - [j80]Igor Fabrici, Jochen Harant, Stanislav Jendrol', Roman Soták:
A note on vertex colorings of plane graphs. Discuss. Math. Graph Theory 34(4): 849-855 (2014) - 2013
- [j79]Stanislav Jendrol', Heinz-Jürgen Voss:
Light subgraphs of graphs embedded in the plane - A survey. Discret. Math. 313(4): 406-421 (2013) - [j78]Mirko Hornák, Stanislav Jendrol':
Preface. Discret. Math. 313(19): 1833-1834 (2013) - [j77]Igor Fabrici, Erhard Hexel, Stanislav Jendrol':
On vertices enforcing a Hamiltonian cycle. Discuss. Math. Graph Theory 33(1): 71-89 (2013) - [j76]Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer:
On maximum weight of a bipartite graph of given order and size. Discuss. Math. Graph Theory 33(1): 147-165 (2013) - 2012
- [j75]Jochen Harant, Stanislav Jendrol':
Nonrepetitive vertex colorings of graphs. Discret. Math. 312(2): 374-380 (2012) - [j74]Stanislav Jendrol', Tomás Kaiser, Zdenek Ryjácek, Ingo Schiermeyer:
A Dirac theorem for trestles. Discret. Math. 312(12-13): 2000-2004 (2012) - [j73]Július Czap, Stanislav Jendrol', Frantisek Kardos, Roman Soták:
Facial parity edge colouring of plane pseudographs. Discret. Math. 312(17): 2735-2740 (2012) - 2011
- [j72]Július Czap, Stanislav Jendrol', Frantisek Kardos:
Facial parity edge colouring. Ars Math. Contemp. 4(2): 255-269 (2011) - [j71]Július Czap, Stanislav Jendrol', Margit Voigt:
Parity vertex colouring of plane graphs. Discret. Math. 311(6): 512-520 (2011) - [j70]Piotr Borowiecki, Kristína Budajová, Stanislav Jendrol', Stanislav Krajci:
Parity vertex colouring of graphs. Discuss. Math. Graph Theory 31(1): 183-195 (2011) - [j69]Július Czap, Stanislav Jendrol', Frantisek Kardos:
On strong parity chromatic number. Discuss. Math. Graph Theory 31(3): 587-600 (2011) - [j68]Július Czap, Stanislav Jendrol', Frantisek Kardos, Jozef Miskuf:
Looseness of Plane Graphs. Graphs Comb. 27(1): 73-85 (2011) - [j67]Frédéric Havet, Stanislav Jendrol', Roman Soták, Erika Skrabul'áková:
Facial non-repetitive edge-coloring of plane graphs. J. Graph Theory 66(1): 38-48 (2011) - [j66]Jochen Harant, Stanislav Jendrol', Tomás Madaras:
Upper bounds on the sum of powers of the degrees of a simple planar graph. J. Graph Theory 67(2): 112-123 (2011) - 2010
- [j65]Stanislav Jendrol', Jozef Miskuf, Roman Soták:
Total edge irregularity strength of complete graphs and complete bipartite graphs. Discret. Math. 310(3): 400-407 (2010) - [j64]Mirko Hornák, Stanislav Jendrol':
Preface. Discret. Math. 310(9): 1407 (2010)
2000 – 2009
- 2009
- [j63]Mirko Hornák, Stanislav Jendrol':
Preface. Discret. Math. 309(15): 4889 (2009) - [j62]Július Czap, Stanislav Jendrol':
Colouring vertices of plane graphs under restrictions given by faces. Discuss. Math. Graph Theory 29(3): 521-543 (2009) - [j61]Stanislav Jendrol', Jozef Miskuf, Roman Soták, Erika Skrabul'áková:
Rainbow faces in edge-colored plane graphs. J. Graph Theory 62(1): 84-99 (2009) - [j60]Zdenek Dvorák, Stanislav Jendrol', Daniel Král, Gyula Pap:
Matchings and Nonrainbow Colorings. SIAM J. Discret. Math. 23(1): 344-348 (2009) - 2008
- [j59]Igor Fabrici, Jochen Harant, Stanislav Jendrol':
Paths of low weight in planar graphs. Discuss. Math. Graph Theory 28(1): 121-135 (2008) - [j58]Jochen Harant, Stanislav Jendrol', Hansjoachim Walther:
On long cycles through four prescribed vertices of a polyhedral graph. Discuss. Math. Graph Theory 28(3): 441-451 (2008) - 2007
- [j57]Stanislav Jendrol', Frantisek Kardos:
On octahedral fulleroids. Discret. Appl. Math. 155(16): 2181-2186 (2007) - [j56]Mirko Hornák, Stanislav Jendrol':
Preface. Discret. Math. 307(7-8): 787 (2007) - [j55]Martin Baca, Stanislav Jendrol', Mirka Miller, Joseph F. Ryan:
On irregular total labellings. Discret. Math. 307(11-12): 1378-1388 (2007) - [j54]Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol', Katsuhiro Ota, Ingo Schiermeyer:
Independence number and vertex-disjoint cycles. Discret. Math. 307(11-12): 1493-1498 (2007) - [j53]Stanislav Jendrol':
Rainbowness of plane graphs. Electron. Notes Discret. Math. 28: 125-129 (2007) - [j52]Stanislav Jendrol', Jozef Miskuf, Roman Soták:
Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs. Electron. Notes Discret. Math. 28: 281-285 (2007) - [j51]Jochen Harant, Stanislav Jendrol':
On the Existence of Specific Stars in Planar Graphs. Graphs Comb. 23(5): 529-543 (2007) - 2006
- [j50]Mieczyslaw Borowiecki, Stanislav Jendrol', Daniel Král, Jozef Miskuf:
List coloring of Cartesian products of graphs. Discret. Math. 306(16): 1955-1958 (2006) - [j49]Stanislav Jendrol':
Rainbowness of cubic plane graphs. Discret. Math. 306(24): 3321-3326 (2006) - [j48]Jaroslav Ivanco, Stanislav Jendrol':
Total edge irregularity strength of trees. Discuss. Math. Graph Theory 26(3): 449-456 (2006) - 2005
- [j47]Peter Jacko, Stanislav Jendrol':
Distance Coloring of the Hexagonal Lattice. Discuss. Math. Graph Theory 25(1-2): 151-166 (2005) - [j46]Stanislav Jendrol', Heinz-Jürgen Voss:
Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds. Eur. J. Comb. 26(3-4): 457-471 (2005) - [j45]Stanislav Jendrol', Heinz-Jürgen Voss:
Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds. J. Comb. Theory, Ser. B 93(1): 1-21 (2005) - 2004
- [j44]Martin Baca, Stanislav Jendrol', Mirka Miller, Joseph F. Ryan:
Antimagic Labelings of Generalized Petersen Graphs That Are Plane. Ars Comb. 73 (2004) - [j43]Mirko Hornák, Stanislav Jendrol':
Preface. Discret. Math. 286(1-2): 1- (2004) - [j42]Stanislav Jendrol', Heinz-Jürgen Voss:
Light classes of generalized stars in polyhedral maps on surfaces. Discuss. Math. Graph Theory 24(1): 85-107 (2004) - 2003
- [j41]Stanislav Jendrol', Heinz-Jürgen Voss:
Light subgraphs of order 4 in large maps of minimum degree 5 on compact 2-manifolds. Australas. J Comb. 28: 171-200 (2003) - [j40]Stanislav Jendrol', Peter J. Owens:
Erratum. Graphs Comb. 19(4): 517-518 (2003) - 2002
- [j39]Stanislav Jendrol', Heinz-Jürgen Voss:
Light paths in large polyhedral maps with prescribed minimum degree. Australas. J Comb. 25: 79-102 (2002) - [j38]Mirko Hornák, Stanislav Jendrol':
Preface. Discret. Math. 251(1-3): 1- (2002) - [j37]Stanislav Jendrol', Heinz-Jürgen Voss:
Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree. Electron. Notes Discret. Math. 11: 386-409 (2002) - 2001
- [j36]Stanislav Jendrol', Ingo Schiermeyer:
On a Max-min Problem Concerning Weights of Edges. Comb. 21(3): 351-359 (2001) - [j35]Stanislav Jendrol', Heinz-Jürgen Voss:
Light subgraphs of multigraphs on compact 2-dimensional manifolds. Discret. Math. 233(1-3): 329-351 (2001) - [j34]Stanislav Jendrol', Zdzislaw Skupien:
Local structures in plane maps and distance colourings. Discret. Math. 236(1-3): 167-177 (2001) - [j33]Stanislav Jendrol', Peter J. Owens:
On Light Graphs in 3-Connected Plane Graphs Without Triangular or Quadrangular Faces. Graphs Comb. 17(4): 659-680 (2001) - [j32]Jochen Harant, Margit Voigt, Stanislav Jendrol', Bert Randerath, Zdenek Ryjácek, Ingo Schiermeyer:
On weights of induced paths and cycles in claw-free and K1, r-free graphs. J. Graph Theory 36(3): 131-143 (2001) - [j31]Stanislav Jendrol', Marián Klesc:
On graphs whose line graphs have crossing number one. J. Graph Theory 37(3): 181-188 (2001) - [j30]Hikoe Enomoto, Mirko Hornák, Stanislav Jendrol':
Cyclic Chromatic Number of 3-Connected Plane Graphs. SIAM J. Discret. Math. 14(1): 121-137 (2001) - 2000
- [j29]Igor Fabrici, Erhard Hexel, Stanislav Jendrol', Hansjoachim Walther:
On vertex-degree restricted paths in polyhedral graphs. Discret. Math. 212(1-2): 61-73 (2000) - [j28]Mirko Hornák, Stanislav Jendrol':
On vertex types and cyclic colourings of 3-connected plane graphs. Discret. Math. 212(1-2): 101-109 (2000) - [j27]Stanislav Jendrol', Heinz-Jürgen Voss:
A local property of polyhedral maps on compact two-dimensional manifolds. Discret. Math. 212(1-2): 111-120 (2000) - [j26]Stanislav Jendrol', Heinz-Jürgen Voss:
Light subgraphs of multigraphs embedded in compact 2-manifolds. Electron. Notes Discret. Math. 5: 189-192 (2000)
1990 – 1999
- 1999
- [j25]Stanislav Jendrol':
Triangles with restricted degrees of their boundary vertices in plane triangulations. Discret. Math. 196(1-3): 177-196 (1999) - [j24]Stanislav Jendrol', Tomás Madaras, Roman Soták, Zsolt Tuza:
On light cycles in plane triangulations. Discret. Math. 197-198: 453-467 (1999) - [j23]Stanislav Jendrol', Heinz-Jürgen Voss:
Subgraphs with Restricted Degrees of their Vertices in Large Polyhedral Maps on Compact Two-manifolds. Eur. J. Comb. 20(8): 821-832 (1999) - [j22]Stanislav Jendrol', Heinz-Jürgen Voss:
A Local Property of Large Polyhedral Maps on Compact 2-Dimensional Manifolds. Graphs Comb. 15(3): 303-313 (1999) - [j21]Jochen Harant, Stanislav Jendrol', Michal Tkác:
On 3-Connected Plane Graphs without Triangular Faces. J. Comb. Theory, Ser. B 77(1): 150-161 (1999) - [j20]Mirko Hornák, Stanislav Jendrol':
On a conjecture by Plummer and Toft. J. Graph Theory 30(3): 177-189 (1999) - 1998
- [j19]Igor Fabrici, Stanislav Jendrol':
Subgraphs with restricted degrees of their vertices in planar graphs. Discret. Math. 191(1-3): 83-90 (1998) - 1997
- [j18]Mirko Hornák, Stanislav Jendrol':
On the d-distance face chromatic number of plane graphs. Discret. Math. 164(1-3): 171-174 (1997) - [j17]Stanislav Jendrol', Zdzislaw Skupien:
Exact Numbers of Longest Cycles with Empty Intersection. Eur. J. Comb. 18(5): 575-578 (1997) - [j16]Igor Fabrici, Stanislav Jendrol':
Subgraphs with Restricted Degrees of Their Vertices in Planar 3-Connected Graphs. Graphs Comb. 13(3): 245-250 (1997) - 1996
- [j15]Stanislav Jendrol', Michal Tkác, Zsolt Tuza:
The irregularity strength and cost of the union of cliques. Discret. Math. 150(1-3): 179-186 (1996) - [j14]Igor Fabrici, Stanislav Jendrol':
An inequality concerning edges of minor weight in convex 3-polytopes. Discuss. Math. Graph Theory 16(1): 81-87 (1996) - [j13]Mirko Hornák, Stanislav Jendrol':
Unavoidable set of face types for planar maps. Discuss. Math. Graph Theory 16(2): 123-141 (1996) - [j12]Stanislav Jendrol', Tomás Madaras:
On light subgraphs in plane graphs of minimum degree five. Discuss. Math. Graph Theory 16(2): 207-217 (1996) - 1995
- [j11]Stanislav Jendrol', Peter J. Owens:
Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters. Discret. Math. 137(1-3): 251-263 (1995) - [j10]Stanislav Jendrol', Michal Tkác:
The irregularity strength of tKp. Discret. Math. 145(1-3): 301-305 (1995) - [j9]Mirko Hornák, Stanislav Jendrol':
On some properties of 4-regular plane graphs. J. Graph Theory 20(2): 163-175 (1995) - 1993
- [j8]