Obserwuj
Gabriel Semanisin
Gabriel Semanisin
Institute of Computer Science, Faculty of Science, P.J. Safarik University, Kosice, Slovakia
Zweryfikowany adres z upjs.sk - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
A survey of hereditary properties of graphs
M Borowiecki, I Broere, M Frick, P Mihok, G Semanišin
Discussiones Mathematicae Graph Theory 17 (1), 5-50, 1997
1811997
Minimum k-path vertex cover
B Brešar, F Kardoš, J Katrenič, G Semanišin
Discrete Applied Mathematics 159 (12), 1189-1195, 2011
1802011
On the vertex k-path cover
B Brešar, M Jakovac, J Katrenič, G Semanišin, A Taranenko
Discrete Applied Mathematics 161 (13-14), 1943-1949, 2013
702013
On the weighted k-path vertex cover problem
B Brešar, R Krivoš-Belluš, G Semanišin, P Šparl
Discrete Applied Mathematics 177, 14-18, 2014
352014
Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
P Mihók, G Semanišin, R Vasky
Journal of Graph Theory 33 (1), 44-53, 2000
342000
Factorizations and characterizations of induced‐hereditary and compositive properties
A Farrugia, P Mihók, RB Richter, G Semanivšin
Journal of Graph Theory 49 (1), 11-27, 2005
202005
Reducible properties of graphs
P Mihók, G Semanišin
Discussiones Mathematicae Graph Theory 15 (1), 11-18, 1995
181995
On computing an optimal semi-matching
F Galčík, J Katrenič, G Semanišin
International Workshop on Graph-Theoretic Concepts in Computer Science, 250-261, 2011
17*2011
Graphs maximal with respect to hom-properties
J Kratochvíl, P Mihók, G Semanišin
Discussiones Mathematicae Graph Theory 17 (1), 77-88, 1997
171997
Maximal graphs with respect to hereditary properties
I Broere, M Frick, G Semanišin
Discussiones Mathematicae Graph Theory 17 (1), 51-66, 1997
161997
Maximum semi-matching problem in bipartite graphs
J Katrenič, G Semanišin
Discussiones Mathematicae Graph Theory 33 (3), 559-569, 2013
132013
A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs
J Katrenic, G Semanisin
arXiv preprint arXiv:1103.1091, 2011
122011
Sequences realizable by maximal k‐degenerate graphs
M Borowiecki, J Ivančo, P Mihók, G Semanišin
Journal of Graph Theory 19 (1), 117-124, 1995
111995
Finding monotone paths in edge-ordered graphs
J Katrenič, G Semanišin
Discrete applied mathematics 158 (15), 1624-1632, 2010
102010
Unique factorization theorem and formal concept analysis
P Mihók, G Semanišin
Concept Lattices and Their Applications: Fourth International Conference …, 2008
102008
On some variations of extremal graph problems
G Semanišin
Discussiones Mathematicae Graph Theory 17 (1), 67-76, 1997
101997
On universal graphs for hom-properties
P Mihók, J Miškuf, G Semanišin
Discussiones Mathematicae Graph Theory 29 (2), 401-409, 2009
82009
A note on maximal -degenerate graphs
Z Filáková, P Mihók, G Semanišin
Mathematica Slovaca 47 (5), 489-498, 1997
81997
Generalized Ramsey theory and decomposable properties of graphs
S Burr, M Jacobson, P Mihók, G Semanišin
Discussiones Mathematicae Graph Theory 19 (2), 199-217, 1999
71999
On the maximal shortest paths cover number
I Peterin, G Semanišin
Mathematics 9 (14), 1592, 2021
62021
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20