Matjaž Krnc
Citata da
Citata da
Cyclic 7-edge-cuts in fullerene graphs
F Kardoš, M Krnc, B Lužar, R Škrekovski
Journal of mathematical chemistry 47 (2), 771-789, 2010
On the diameter and some related invariants of fullerene graphs
V Andova, T Došlić, M Krnc, B Lužar, R Škrekovski
Match-Communications In Mathematical And In Computer Chemistry 68 (1), 109-130, 2012
Improved induced matchings in sparse graphs
R Erman, Ł Kowalik, M Krnc, T Waleń
Parameterized and Exact Computation, 134-148, 2009
On Wiener Inverse Interval Problem
M Krnc, R Škrekovski
MATCH Communications in Mathematical and in Computer Chemistry 75 (1), 71--80, 2015
Centralization of transmission in networks
M Krnc, R Škrekovski
Discrete Mathematics 338 (12), 2412-2420, 2015
Cyclic colorings of plane graphs with independent faces
J Azarija, R Erman, D Krl, M Krnc, L Stacho
European Journal of Combinatorics, 2011
Group centralization of network indices
M Krnc, R Škrekovski
Discrete Applied Mathematics 186, 147-157, 2015
Eccentricity of networks with structural constraints
M Krnc, JS Sereni, R Škrekovski, ZB Yilma
Discussiones Mathematicae Graph Theory 40 (4), 1141-1162, 2020
On the end-vertex problem of graph searches
J Beisegel, C Denkert, E Khler, M Krnc, N Pivač, R Scheffler, M Strehler
Discrete Mathematics & Theoretical Computer Science, 2019, 2018
Characterization of generalized Petersen graphs that are Kronecker covers
M Krnc, T Pisanski
arXiv preprint arXiv:1802.07134, 2018
Extending Fractional Precolorings
D Krl', M Krnc, M Kupec, B Lužar, J Volec
SIAM Journal on Discrete Mathematics 26, 647, 2012
Closeness centralization measure for two-mode data of prescribed sizes
M Krnc, JS Sereni, R Škrekovski, ZB Yilma
Network Science 4 (4), 474-490, 2016
Generalized Petersen graphs and Kronecker covers
T Pisanski, M Krnc
Discrete Mathematics & Theoretical Computer Science 21, 2019
Recognizing graph search trees
J Beisegel, C Denkert, E Khler, M Krnc, N Pivač, R Scheffler, M Strehler
Electronic notes in theoretical computer science 346, 99-110, 2019
Generalized Petersen graphs are recognizable in linear time
M Krnc, RJ Wilson
Discrete Applied Mathematics, 2017
Fast recognition of some parametric graph families
N Klobas, M Krnc
arXiv preprint arXiv:2008.08856, 2020
Shifting paths to avoidable ones
V Gurvich, M Krnc, M Milanič, M Vyalyi
arXiv preprint arXiv:2008.01128, 2020
Positive Aging Admits Fast Asynchronous Plurality Consensus
G Bankhamer, R Elssser, D Kaaser, M Krnc
Proceedings of the 39th Symposium on Principles of Distributed Computing…, 2020
Fair packing of independent sets
N Chiarelli, M Krnc, M Milanič, U Pferschy, N Pivač, J Schauer
International Workshop on Combinatorial Algorithms, 154-165, 2020
Edge elimination schemes of weighted graph classes, Workshop on Graph Modification algorithms, experiments and new problems, 23rd-24th January 2020, Bergen, Norway
M Milanič, J Beisegel, N Chiarelli, E Khler, M Krnc, N Mitrović, ...
Univerza na Primorskem, Inštitut Andrej Marušič, 2020
Il sistema al momento non pu eseguire l'operazione. Riprova pi tardi.
Articoli 1–20