受强制性开放获取政策约束的文章 - Gabriel Semanisin了解详情
可在其他位置公开访问的文章：5 篇
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
强制性开放获取政策： European Commission
On the maximal shortest paths cover number
I Peterin, G Semanišin
Mathematics 9 (14), 1592, 2021
强制性开放获取政策： Slovenian Research Agency
Hitting subgraphs in P4-tidy graphs
B Brešar, T Kos, R Krivoš-Belluš, G Semanišin
Applied Mathematics and Computation 352, 211-219, 2019
强制性开放获取政策： Slovenian Research Agency
Geodesic transversal problem for join and lexicographic product of graphs
I Peterin, G Semanišin
Computational and Applied Mathematics 41 (4), 128, 2022
强制性开放获取政策： Slovenian Research Agency
Some bounds on the generalised total chromatic number of degenerate graphs
I Broere, G Semanišin
Information Processing Letters 122, 30-33, 2017
强制性开放获取政策： National Research Foundation, South Africa
出版信息和资助信息由计算机程序自动确定