default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJán Plesník
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2008
[j23]Ján Plesník:
Examples of goal-minimally k-diametric graphs for some small values of k. Australas. J Comb. 41: 93-106 (2008)- 2004
- [j22]Ján Plesník:
Minimum k-geodetically connected digraphs. Networks 44(4): 243-253 (2004) - 2003
- [j21]Ján Plesník:
Towards minimum k-geodetically connected graphs. Networks 41(2): 73-82 (2003) - 2001
- [j20]Ján Plesník:
Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph. J. Comb. Optim. 5(3): 275-286 (2001) - 2000
- [j19]Edy Tri Baskoro, Mirka Miller, Ján Plesník:
Further results on almost Moore digraphs. Ars Comb. 56 (2000) - 1999
- [j18]Ján Plesník:
Constrained Weighted Matchings and Edge Coverings in Graphs. Discret. Appl. Math. 92(2-3): 229-241 (1999) - 1998
- [j17]Ljiljana Brankovic, Mirka Miller, Ján Plesník, Joe Ryan, Jozef Sirán:
Large graphs with small degree and diameter: a voltage assignment approach. Australas. J Comb. 18: 65-76 (1998) - [j16]Ljiljana Brankovic
, Mirka Miller, Ján Plesník, Joseph F. Ryan, Jozef Sirán:
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments. Electron. J. Comb. 5 (1998) - [j15]Edy Tri Baskoro, Mirka Miller, Ján Plesník:
On the Structure of Digraphs with Order Close to the Moore Bound. Graphs Comb. 14(2): 109-119 (1998) - 1995
- [j14]Edy Tri Baskoro, Mirka Miller, Ján Plesník, Stefan Znám:
Regular digraphs of diamter 2 and maximum order: Corrigenda. Australas. J Comb. 12: 305- (1995) - [j13]Edy Tri Baskoro, Mirka Miller, Ján Plesník, Stefan Znám:
Digraphs of degree 3 and order close to the moore bound. J. Graph Theory 20(3): 339-349 (1995) - 1994
- [j12]Edy Tri Baskoro, Mirka Miller, Ján Plesník, Stephan Znám:
Regular digraphs of diameter 2 and maximum order. Australas. J Comb. 9: 291-306 (1994) - 1993
- [j11]Mamadi Diané, Ján Plesník:
An integer programming formulation of the Steiner problem in graphs. ZOR Methods Model. Oper. Res. 37(1): 107-111 (1993) - 1992
- [j10]Ján Plesník:
Heuristics for the Steiner Problem in Graphs. Discret. Appl. Math. 37/38: 451-463 (1992) - 1987
- [j9]Ján Plesník:
A heuristic for the p-center problems in graphs. Discret. Appl. Math. 17(3): 263-268 (1987) - 1984
- [j8]Ján Plesník:
A note on the complexity of finding regular subgraphs. Discret. Math. 49(2): 161-167 (1984) - [j7]Ján Plesník:
Equivalence between the minimum covering problem and the maximum matching problem. Discret. Math. 49(3): 315-317 (1984) - [j6]Ján Plesník:
A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs. J. Comb. Theory B 36(3): 284-297 (1984) - [j5]Ján Plesník:
On the sum of all distances in a graph or digraph. J. Graph Theory 8(1): 1-21 (1984) - 1981
- [j4]Ján Plesník:
The complexity of designing a network with minimum diameter. Networks 11(1): 77-85 (1981) - 1979
- [j3]Ján Plesník:
The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two. Inf. Process. Lett. 8(4): 199-201 (1979) - 1978
- [j2]Ján Plesník:
Bounds on chromatic numbers of multiple factors of a complete graph. J. Graph Theory 2(1): 9-17 (1978) - 1974
- [j1]Ján Plesník:
One method for proving the impossibility of certain Moore graphs. Discret. Math. 8(4): 363-376 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
