# zbMATH — the first resource for mathematics

## Plesník, Ján

Compute Distance To:
 Author ID: plesnik.jan Published as: Plesník, Ján; Plesnik, Jan
 Documents Indexed: 67 Publications since 1969 Reviewing Activity: 268 Reviews
all top 5

#### Co-Authors

 45 single-authored 8 Gliviak, Ferdinand 8 Miller, Mirka 6 Baskoro, Edy Tri 5 Znam, Stefan 4 Širáň, Jozef 3 Branković, Ljiljana 3 Ryan, Joe 2 Diané, Mamadi 2 Kotzig, Anton 2 Kyš, Peter 1 Porubsky, Stefan 1 Rosa, Alexander 1 Wawruch, Alojz
all top 5

#### Serials

 8 Mathematica Slovaca 6 Acta Facultatis Rerum Naturalium Universitatis Comenianae. Mathematica 5 Acta Mathematica Universitatis Comenianae 5 Matematický Časopis, Slovenskej Akadémie Vied 4 The Australasian Journal of Combinatorics 3 Discrete Applied Mathematics 3 Discrete Mathematics 3 Journal of Graph Theory 3 Networks 2 Acta Mathematica Academiae Scientiarum Hungaricae 2 Acta Mathematica Universitatis Comenianae. New Series 1 Information Processing Letters 1 Aplikace Matematiky 1 Archiv der Mathematik 1 Archivum Mathematicum 1 Ars Combinatoria 1 Bulletin Mathématique de la Société des Sciences Mathématiques de la République Socialiste de Roumanie. Nouvelle Série 1 Časopis Pro Pěstování Matematiky 1 Czechoslovak Mathematical Journal 1 Journal of Combinatorial Theory. Series B 1 Monatshefte für Mathematik 1 Optimization 1 Graphs and Combinatorics 1 JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing 1 Glasnik Matematički. Serija III 1 Linear Algebra and its Applications 1 ZOR. Zeitschrift für Operations Research 1 The Electronic Journal of Combinatorics 1 Journal of Combinatorial Optimization 1 IJMA. International Journal of Mathematical Algorithms
all top 5

#### Fields

 57 Combinatorics (05-XX) 17 Computer science (68-XX) 6 Operations research, mathematical programming (90-XX) 1 History and biography (01-XX) 1 Numerical analysis (65-XX) 1 Information and communication theory, circuits (94-XX)

#### Citations contained in zbMATH Open

50 Publications have been cited 447 times in 368 Documents Cited by Year
On the sum of all distances in a graph or digraph. Zbl 0552.05048
Plesník, Ján
1984
Critical graphs of given diameter. Zbl 0318.05115
Plesnik, Jan
1975
Strongly geodetic directed graphs. Zbl 0291.05106
Plesník, Ján; Znám, Štefan
1974
A heuristic for the p-center problem in graphs. Zbl 0637.05020
Plesník, Ján
1987
The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two. Zbl 0399.68070
Plesnik, Jan
1979
Connectivity of regular graphs and the existence of 1-factors. Zbl 0247.05159
Plesnik, Jan
1972
On equality of edge-connectivity and minimum degree of a graph. Zbl 0731.05035
Plesník, Ján; Znám, Štefan
1989
On the computational complexity of centers locating in a graph. Zbl 0454.68026
Plesnik, Jan
1980
A bound for the Steiner tree problem in graphs. Zbl 0458.05027
Plesnik, Jan
1981
Remarks on diameters of orientations of graphs. Zbl 0613.05024
Plesník, Ján
1985
Constrained weighted matchings and edge coverings in graphs. Zbl 0930.05079
Plesník, Ján
1999
The complexity of designing a network with minimum diameter. Zbl 0459.68028
Plesnik, Jan
1981
On the structure of digraphs with order close to the Moore bound. Zbl 0905.05033
Baskoro, Edy Tri; Miller, Mirka; Plesník, Ján
1998
Two constructions of geodetic graphs. Zbl 0347.05113
Plesnik, Jan
1977
Diametrically critical tournaments. Zbl 0315.05108
Plesnik, Jan
1975
Equivalence between the minimum covering problem and the maximum matching problem. Zbl 0581.05045
Plesník, Ján
1984
A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs. Zbl 0527.05043
Plesník, Ján
1984
A note on the complexity of finding regular subgraphs. Zbl 0567.05029
Plesník, Ján
1984
Bounds on chromatic numbers of multiple factors of a complete graph. Zbl 0375.05027
Plesnik, Jan
1978
Digraphs of degree 3 and order close to the Moore bound. Zbl 0838.05054
Baskoro, Edy Tri; Miller, Mirka; Plesník, Ján; Znám, Štefan
1995
Remarks on regular factors of regular graphs. Zbl 0311.05132
Plesnik, Jan
1974
Minimum block containing a given graph. Zbl 0338.05119
Plesnik, Jan
1976
Remark on the graphs with a central symmetry. Zbl 0202.55701
Glivjak, Ferdinand; Kotzig, Aanton; Plesník, Ján
1970
A note on constructing large Cayley graphs of given degree and diameter by voltage assignments. Zbl 0885.05071
Branković, Ljiljana; Miller, Mirka; Plesník, Ján; Ryan, Joe; Širáň, Jozef
1998
The NP-completeness of the Hamiltonian cycle problem in bipartite cubic planar graphs. Zbl 0539.05043
Plesník, Ján
1983
Regular digraphs of diameter 2 and maximum order. Zbl 0808.05052
Baskoro, Edy Tri; Miller, Mirka; Plesník, Ján; Znám, Štefan
1994
On the extension of graphs with a given diameter without superfluous edges. Zbl 0185.27803
Glivjak, Ferdinand; Kyš, Peter; Plesník, Ján
1969
On minimal graphs of diameter 2 with every edge in a 3-cycle. Zbl 0603.05040
Plesník, Ján
1986
Towards minimum $$k$$-geodetically connected graphs. Zbl 1014.05022
Plesník, Ján
2003
Large digraphs with small diameter: A voltage assignment approach. Zbl 0884.05046
Baskoro, Edy Tri; Branković, Ljiljana; Miller, Mirka; Plesník, Ján; Ryan, Joe; Širáň, Jozef
1997
Further results on almost Moore digraphs. Zbl 0994.05069
Baskoro, Edy Tri; Miller, Mirka; Plesník, Ján
2000
On homogeneous tournaments. Zbl 0194.25501
Plesnik, Jan
1969
A construction of geodetic blocks. Zbl 0507.05040
Plesník, Ján
1980
Minimum cost edge subset covering exactly $$k$$ vertices of a graph. Zbl 1078.90063
Plesník, Ján
2001
One method for proving the impossibility of certain Moore graphs. Zbl 0287.05114
Plesnik, Jan
1974
Complexity of decomposing graphs into factors with given diameters or radii. Zbl 0505.05052
Plesnik, Jan
1982
Heuristics for the Steiner problem in graphs. Zbl 0768.68171
Plesník, Ján
1992
Large graphs with small degree and diameter: A voltage assignment approach. Zbl 0929.05040
Branković, Ljiljana; Miller, Mirka; Plesník, Ján; Ryan, Joe; Širáň, Jozef
1998
Minimum $$k$$-geodetically connected digraphs. Zbl 1055.05072
Plesník, Ján
2004
Examples of goal-minimally $$k$$-diametric graphs for some small values of $$k$$. Zbl 1158.05024
Plesník, Ján
2008
On the interchange heuristic for locating centers and medians in a graph. Zbl 0642.05030
Plesník, Ján
1987
Finding the orthogonal projection of a point onto an affine subspace. Zbl 1171.65016
Plesník, Ján
2007
Remark on matchings in regular graphs. Zbl 0421.05054
Plesnik, Jan
1979
On bases of linear factors of graphs. Zbl 0257.05124
Glivjak, Ferdinand; Kotzig, Anton; Plesnik, Jan
1973
Graphs with a homogeneity. Zbl 0311.05134
Plesnik, Jan
1975
Note on diametrically critical graphs. Zbl 0326.05118
Plesnik, Jan
1975
Professor Štefan Znám (1936–1993). Zbl 0808.01025
Plesník, Ján; Porubský, Štefan; Rosa, Alex; Širáň, Jozef
1994
Worst-case relative performances of heuristics for the Steiner problem in graphs. Zbl 0738.68064
Plesník, Ján
1991
Bad examples of the metric traveling salesman problem for the 2-change heuristic. Zbl 0633.90083
Plesník, Ján
1986
Two heuristics for the absolute p-center problem in graphs. Zbl 0654.05058
Plesník, Ján
1988
Examples of goal-minimally $$k$$-diametric graphs for some small values of $$k$$. Zbl 1158.05024
Plesník, Ján
2008
Finding the orthogonal projection of a point onto an affine subspace. Zbl 1171.65016
Plesník, Ján
2007
Minimum $$k$$-geodetically connected digraphs. Zbl 1055.05072
Plesník, Ján
2004
Towards minimum $$k$$-geodetically connected graphs. Zbl 1014.05022
Plesník, Ján
2003
Minimum cost edge subset covering exactly $$k$$ vertices of a graph. Zbl 1078.90063
Plesník, Ján
2001
Further results on almost Moore digraphs. Zbl 0994.05069
Baskoro, Edy Tri; Miller, Mirka; Plesník, Ján
2000
Constrained weighted matchings and edge coverings in graphs. Zbl 0930.05079
Plesník, Ján
1999
On the structure of digraphs with order close to the Moore bound. Zbl 0905.05033
Baskoro, Edy Tri; Miller, Mirka; Plesník, Ján
1998
A note on constructing large Cayley graphs of given degree and diameter by voltage assignments. Zbl 0885.05071
Branković, Ljiljana; Miller, Mirka; Plesník, Ján; Ryan, Joe; Širáň, Jozef
1998
Large graphs with small degree and diameter: A voltage assignment approach. Zbl 0929.05040
Branković, Ljiljana; Miller, Mirka; Plesník, Ján; Ryan, Joe; Širáň, Jozef
1998
Large digraphs with small diameter: A voltage assignment approach. Zbl 0884.05046
Baskoro, Edy Tri; Branković, Ljiljana; Miller, Mirka; Plesník, Ján; Ryan, Joe; Širáň, Jozef
1997
Digraphs of degree 3 and order close to the Moore bound. Zbl 0838.05054
Baskoro, Edy Tri; Miller, Mirka; Plesník, Ján; Znám, Štefan
1995
Regular digraphs of diameter 2 and maximum order. Zbl 0808.05052
Baskoro, Edy Tri; Miller, Mirka; Plesník, Ján; Znám, Štefan
1994
Professor Štefan Znám (1936–1993). Zbl 0808.01025
Plesník, Ján; Porubský, Štefan; Rosa, Alex; Širáň, Jozef
1994
Heuristics for the Steiner problem in graphs. Zbl 0768.68171
Plesník, Ján
1992
Worst-case relative performances of heuristics for the Steiner problem in graphs. Zbl 0738.68064
Plesník, Ján
1991
On equality of edge-connectivity and minimum degree of a graph. Zbl 0731.05035
Plesník, Ján; Znám, Štefan
1989
Two heuristics for the absolute p-center problem in graphs. Zbl 0654.05058
Plesník, Ján
1988
A heuristic for the p-center problem in graphs. Zbl 0637.05020
Plesník, Ján
1987
On the interchange heuristic for locating centers and medians in a graph. Zbl 0642.05030
Plesník, Ján
1987
On minimal graphs of diameter 2 with every edge in a 3-cycle. Zbl 0603.05040
Plesník, Ján
1986
Bad examples of the metric traveling salesman problem for the 2-change heuristic. Zbl 0633.90083
Plesník, Ján
1986
Remarks on diameters of orientations of graphs. Zbl 0613.05024
Plesník, Ján
1985
On the sum of all distances in a graph or digraph. Zbl 0552.05048
Plesník, Ján
1984
Equivalence between the minimum covering problem and the maximum matching problem. Zbl 0581.05045
Plesník, Ján
1984
A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs. Zbl 0527.05043
Plesník, Ján
1984
A note on the complexity of finding regular subgraphs. Zbl 0567.05029
Plesník, Ján
1984
The NP-completeness of the Hamiltonian cycle problem in bipartite cubic planar graphs. Zbl 0539.05043
Plesník, Ján
1983
Complexity of decomposing graphs into factors with given diameters or radii. Zbl 0505.05052
Plesnik, Jan
1982
A bound for the Steiner tree problem in graphs. Zbl 0458.05027
Plesnik, Jan
1981
The complexity of designing a network with minimum diameter. Zbl 0459.68028
Plesnik, Jan
1981
On the computational complexity of centers locating in a graph. Zbl 0454.68026
Plesnik, Jan
1980
A construction of geodetic blocks. Zbl 0507.05040
Plesník, Ján
1980
The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two. Zbl 0399.68070
Plesnik, Jan
1979
Remark on matchings in regular graphs. Zbl 0421.05054
Plesnik, Jan
1979
Bounds on chromatic numbers of multiple factors of a complete graph. Zbl 0375.05027
Plesnik, Jan
1978
Two constructions of geodetic graphs. Zbl 0347.05113
Plesnik, Jan
1977
Minimum block containing a given graph. Zbl 0338.05119
Plesnik, Jan
1976
Critical graphs of given diameter. Zbl 0318.05115
Plesnik, Jan
1975
Diametrically critical tournaments. Zbl 0315.05108
Plesnik, Jan
1975
Graphs with a homogeneity. Zbl 0311.05134
Plesnik, Jan
1975
Note on diametrically critical graphs. Zbl 0326.05118
Plesnik, Jan
1975
Strongly geodetic directed graphs. Zbl 0291.05106
Plesník, Ján; Znám, Štefan
1974
Remarks on regular factors of regular graphs. Zbl 0311.05132
Plesnik, Jan
1974
One method for proving the impossibility of certain Moore graphs. Zbl 0287.05114
Plesnik, Jan
1974
On bases of linear factors of graphs. Zbl 0257.05124
Glivjak, Ferdinand; Kotzig, Anton; Plesnik, Jan
1973
Connectivity of regular graphs and the existence of 1-factors. Zbl 0247.05159
Plesnik, Jan
1972
Remark on the graphs with a central symmetry. Zbl 0202.55701
Glivjak, Ferdinand; Kotzig, Aanton; Plesník, Ján
1970
On the extension of graphs with a given diameter without superfluous edges. Zbl 0185.27803
Glivjak, Ferdinand; Kyš, Peter; Plesník, Ján
1969
On homogeneous tournaments. Zbl 0194.25501
Plesnik, Jan
1969
all top 5

#### Cited by 550 Authors

 21 Dankelmann, Peter 13 Miller, Mirka 12 Plesník, Ján 11 Fiol, Miquel Angel 11 Škrekovski, Riste 10 Henning, Michael Anthony 8 Haynes, Teresa W. 8 Knor, Martin 7 Balbuena, Camino 7 Fàbrega, Josep 7 Koh, Khee Meng 6 Gimbert, Joan 6 Oellermann, Ortrud R. 6 Volkmann, Lutz 6 Yeo, Anders 5 Gutman, Ivan M. 5 Potočnik, Primož 5 Swart, Henda C. 4 Hellwig, Angelika 4 Híc, Pavol 4 López, Nacho 4 Miret, Josep M. 4 Ryan, Joe 4 Stevanović, Dragan 4 Tay, Eng Guan 4 Horvat, Aleksandra Tepeh 4 van der Merwe, Lucas C. 4 West, Douglas Brent 4 Wu, Baoyindureng 4 Zhou, Bo 3 An, Xinhui 3 Canale, Eduardo A. 3 Dobrynin, Andrey A. 3 Feldmann, Andreas Emil 3 Feng, Lihua 3 Fernau, Henning 3 García-Vázquez, Pedro 3 Gomez, Jose 3 He, Zhihong 3 Lu, Mei 3 Marx, Dániel 3 Müller-Hannemann, Matthias 3 Orlovich, Yury L. 3 Pérez-Rosés, Hebert 3 Pujolàs, Jordi 3 Shiu, Wai Chee 3 Su, Guifu 3 Tazari, Siamak 3 Woeginger, Gerhard Johannes 3 Wu, Yaokun 3 Yeh, Yeong-Nan 3 Ždímalová, Mária 2 Alsuwaiyel, Muhammad H. 2 Balbuena, M. C. 2 Bickle, Allan 2 Bosak, Juraj 2 Che, Zhongyuan 2 Cheng, Eddie 2 Comellas, Francesc 2 Conde, Josep 2 Cygan, Marek 2 Das, Kinkar Chandra 2 Das, Sandip 2 Ding, Wei 2 Dossou-Olory, Audace A. V. 2 Entringer, Roger Charles 2 Esperet, Louis 2 Goddard, Wayne Dean 2 Gordon, Valery S. 2 Gørtz, Inge Li 2 Gualà, Luciano 2 Győri, Ervin 2 Gyürki, Štefan 2 Handa, Keiichi 2 Hansberg, Adriana 2 Hansen, Pierre 2 Hassin, Refael 2 Huang, Shuqiang 2 Ikica, Barbara 2 Ilić, Aleksandar 2 Jajcay, Robert 2 Jampani, Krishnam Raju 2 Joubert, Ernst J. 2 Kardoš, František 2 Katerinis, Panagiotis 2 Kerivin, Hervé L. M. 2 Klavžar, Sandi 2 Könemann, Jochen 2 Kostochka, Aleksandr Vasil’evich 2 Kozyrev, V. P. 2 Král’, Daniel 2 Lacroix, Mathieu 2 Lam, Peter Che Bor 2 Li, Daobin 2 Li, Shuchao 2 Li, Yang 2 Lin, Shangwei 2 Lin, Yuqing 2 Lipman, Marc J. 2 Lipták, László ...and 450 more Authors
all top 5

#### Cited in 76 Serials

 78 Discrete Applied Mathematics 55 Discrete Mathematics 16 Theoretical Computer Science 15 Mathematica Slovaca 13 Algorithmica 11 Journal of Combinatorial Optimization 10 Graphs and Combinatorics 9 Applied Mathematics and Computation 9 Journal of Combinatorial Theory. Series B 8 Information Processing Letters 8 Networks 6 European Journal of Combinatorics 6 European Journal of Operational Research 5 Linear Algebra and its Applications 5 Discussiones Mathematicae. Graph Theory 4 Czechoslovak Mathematical Journal 4 Journal of Graph Theory 4 Computational Geometry 4 International Journal of Computer Mathematics 3 Journal of Soviet Mathematics 3 Operations Research Letters 3 Combinatorica 3 Discrete & Computational Geometry 3 Annals of Operations Research 3 Journal of Discrete Algorithms 3 Discrete Optimization 3 Mathematics in Computer Science 2 Communications in Algebra 2 Periodica Mathematica Hungarica 2 Journal of Computer and System Sciences 2 Acta Mathematicae Applicatae Sinica. English Series 2 Computers & Operations Research 2 Applied Mathematics Letters 2 Mathematical and Computer Modelling 2 Designs, Codes and Cryptography 2 Mathematical Programming. Series A. Series B 2 The Australasian Journal of Combinatorics 2 Theory of Computing Systems 2 Acta Mathematica Sinica. English Series 2 Journal of the Operations Research Society of China 1 Acta Informatica 1 Bulletin of the Australian Mathematical Society 1 Computers & Mathematics with Applications 1 Linear and Multilinear Algebra 1 Mathematical Notes 1 The Mathematical Intelligencer 1 Advances in Mathematics 1 Information Sciences 1 Publications of the Research Institute for Mathematical Sciences, Kyoto University 1 Acta Applicandae Mathematicae 1 Optimization 1 SIAM Journal on Discrete Mathematics 1 International Journal of Foundations of Computer Science 1 Discrete Mathematics and Applications 1 Games and Economic Behavior 1 Aequationes Mathematicae 1 Applied Mathematical Modelling 1 ZOR. Zeitschrift für Operations Research 1 Journal of Mathematical Sciences (New York) 1 The Electronic Journal of Combinatorics 1 INFORMS Journal on Computing 1 Soft Computing 1 Discrete Dynamics in Nature and Society 1 Natural Computing 1 Journal of Applied Mathematics and Computing 1 Journal of Algebra and its Applications 1 Computational Management Science 1 International Journal of Parallel, Emergent and Distributed Systems 1 Matematický Časopis, Slovenskej Akadémie Vied 1 Proceedings of the Steklov Institute of Mathematics 1 Discrete Mathematics, Algorithms and Applications 1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ 1 Transactions on Combinatorics 1 Computer Science Review 1 ISRN Combinatorics 1 European Journal of Mathematics
all top 5

#### Cited in 17 Fields

 302 Combinatorics (05-XX) 83 Computer science (68-XX) 57 Operations research, mathematical programming (90-XX) 11 Biology and other natural sciences (92-XX) 6 Linear and multilinear algebra; matrix theory (15-XX) 5 Information and communication theory, circuits (94-XX) 4 Convex and discrete geometry (52-XX) 4 Numerical analysis (65-XX) 2 General and overarching topics; collections (00-XX) 2 History and biography (01-XX) 2 Group theory and generalizations (20-XX) 2 Statistics (62-XX) 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Associative rings and algebras (16-XX) 1 Geometry (51-XX) 1 Manifolds and cell complexes (57-XX)