Követés
Stanislav Jendroµ
Stanislav Jendroµ
Ismeretlen szervezet
E-mail megerősítve itt: upjs.sk - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
On irregular total labellings
M Bača, S Jendroµ, M Miller, J Ryan
Discrete Mathematics 307 (11), 1378-1388, 2007
4312007
Total edge irregularity strength of trees
J Ivančo, S Jendroµ
Discussiones Mathematicae Graph Theory 26 (3), 449, 2006
1652006
Light subgraphs of graphs embedded in the plane—A survey
S Jendroµ, HJ Voss
Discrete Mathematics 313 (4), 406-421, 2013
1252013
Conjectures and open problems on face antimagic evaluations of graphs
M Bača, ET Baskoro, YM Cholili, S Jendroµ, Y Lin, M Miller, J Ryan, ...
Journal of Indonesian Math. Soc. 11 (2), 175-192, 2005
103*2005
On light subgraphs in plane graphs of minimum degree five.
S Jendroµ, T Madaras
Discussiones Mathematicae Graph Theory 16 (2), 207-217, 1996
851996
Total edge irregularity strength of complete graphs and complete bipartite graphs
J Miąkuf, R Soták
Electronic notes in discrete mathematics 28, 281-285, 2007
812007
On the crossing numbers of Sm× Pn and Sm× Cn
S Jendrol, M ©cerbová
Casopis pro pestování matematiky 107, 225-230, 1982
741982
Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
I Fabrici, S Jendroµ
Graphs and Combinatorics 13 (3), 245-250, 1997
591997
On a conjecture by Plummer and Toft
M Horňák, S Jendroµ
Journal of Graph Theory 30 (3), 177-189, 1999
55*1999
On light cycles in plane triangulations
S Jendroµ, T Madaras, R Soták, Z Tuza
Discrete mathematics 197, 453-467, 1999
481999
On total edge irregularity strength of the grids
J Miąkuf, S Jendroµ
Tatra Mountains Mathematical Publications 36, 147-151, 2007
462007
A structural property of convex 3-polytopes
S Jendrol
Geometriae Dedicata 68 (1), 91-99, 1997
431997
The irregularity strength and cost of the union of cliques
S Jendroµ, M Tkáč, Z Tuza
Discrete Mathematics 150 (1-3), 179-186, 1996
421996
Total vertex irregular labeling of complete bipartite graphs
K Wijaya, Slamin, Surahmat, S Jendroµ
JCMCC 55, 129-136, 2005
412005
Cyclic chromatic number of 3-connected plane graphs
H Enomoto, M Hornák, S Jendrol'
SIAM Journal on Discrete Mathematics 14 (1), 121-137, 2001
392001
Describing short paths in plane graphs of girth at least 5
S Jendrol, M Maceková
Discrete Mathematics 338 (2), 149-158, 2015
382015
Rainbow numbers for cycles in plane triangulations
M Horňák, S Jendrol′, I Schiermeyer, R Soták
Journal of Graph Theory 78 (4), 248-257, 2015
342015
Rainbow numbers for matchings in plane triangulations
I Schiermeyer, J Tu
Discrete Mathematics 331, 158-164, 2014
342014
Nonrepetitive vertex colorings of graphs
J Harant, S Jendroµ
Discrete Mathematics 312 (2), 374-380, 2012
332012
Antimagic labelings of generalized Petersen graphs that are plane
M Bača, S Jendroµ, M Miller, J Ryan
Ars Combinatoria 73, 115-128, 2004
332004
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20