Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Ján Plesník
Observed names:
J Plesník,
J. Plesnik,
J. Plesn´ik,
J. Plesník,
Ján Plesnı́k,
Plesník, Ján
show all 6
Institution:
Comenius University Bratislava
Observed institutions:
Slovak University of Technology in Bratislava,
Comenius University Bratislava,
University of Newcastle Australia
OpenAlex ID:
A5110158773
Works
47
Awards
1
On the sum of all distances in a graph or digraph
1984
·
Ján Plesník
·
Journal of Graph Theory
·
272
The np-completeness of the hamiltonian cycle problem in planar diagraphs with degree bound two
1979
·
J. Plesn´ik
·
Information Processing Letters
·
143
Critical Graphs of Given Diameter.
1975
·
Ján Plesnı́k
·
130
A heuristic for the p-center problems in graphs
1987
·
J. Plesník
·
Discrete Applied Mathematics
·
117
PDF
A bound for the Steiner tree problem in graphs
1981
·
Ján Plesnı́k
·
Czech digital mathematics library
·
76
Connectivity of Regular Graphs and the Existence of 1-Factors
1972
·
Ján Plesnı́k
·
Czech digital mathematics library
·
76
PDF
The complexity of designing a network with minimum diameter
1981
·
J. Plesnik
·
Networks
·
60
On equality of edge-connectivity and minimum degree of a graph
1989
·
Ján Plesnı́k
, Štefan Znám
·
Czech digital mathematics library
·
41
PDF
Constrained weighted matchings and edge coverings in graphs
1999
·
Ján Plesnı́k
·
Discrete Applied Mathematics
·
40
PDF
On the computational complexity of centers locating in a graph
1980
·
Ján Plesník
·
Applications of Mathematics
·
40
PDF
On the Structure of Digraphs with Order Close to the Moore Bound
1998
·
Edy Tri Baskoro
, Mirka Miller
, et al.
·
Graphs and Combinatorics
·
32
Bounds on chromatic numbers of multiple factors of a complete graph
1978
·
Ján Plesník
·
Journal of Graph Theory
·
32
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
1997
·
Ljiljana Branković
, Mirka Miller
, et al.
·
The Electronic Journal of Combinatorics
·
30
PDF
Digraphs of degree 3 and order close to the moore bound
1995
·
Edy Tri Baskoro
, Mirka Miller
, et al.
·
Journal of Graph Theory
·
30
A note on the complexity of finding regular subgraphs
1984
·
J. Plesník
·
Discrete Mathematics
·
28
Regular digraphs of diameter 2 and maximum order.
1994
·
Edy Tri Baskoro
, Mirka Miller
, et al.
·
Australas. J Comb.
·
22
Two constructions of geodetic graphs
1977
·
Ján Plesnı́k
·
Czech digital mathematics library
·
22
PDF
Large graphs with small degree and diameter: a voltage assignment approach.
1998
·
Ljiljana Branković
, Mirka Miller
, et al.
·
Australas. J Comb.
·
21
Worst-case Relative Performances of Heuristics for the Steiner Problem in Graphs
1991
·
Ján Plesnı́k
·
19
Finding the orthogonal projection of a point onto an affine subspace
2007
·
Ján Plesník
·
Linear Algebra and its Applications
·
18
PDF
Heuristics for the Steiner problem in graphs
1992
·
J. Plesník
·
Discrete Applied Mathematics
·
18
Diametrically critical tournaments
1975
·
Ján Plesník
·
Časopis pro pěstování matematiky
·
16
Equivalence between the minimum covering problem and the maximum matching problem
1984
·
Ján Plesník
·
Discrete Mathematics
·
15
On the Extension of Graphs with a Given Diameter without Superfluous Edges
1969
·
Ferdinand Gliviak
, Peter Kyš
, et al.
·
Czech digital mathematics library
·
15
A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs
1984
·
J Plesník
·
Journal of Combinatorial Theory Series B
·
14
PDF
Show more works
View as search
Works count:
47
Citation count:
1,409
H-index:
19
I10-index:
27
Year
Topic
Type