Ján Plesník

发表

The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two

Ján Plesník, J. Plesník, 1979, Inf. Process. Lett..

A heuristic for the p-center problems in graphs

Ján Plesník, J. Plesník, 1987, Discret. Appl. Math..

Minimum k-geodetically connected digraphs

Ján Plesník, 2004, Networks.

On the sum of all distances in a graph or digraph

Ján Plesník, J. Plesník, 1984, J. Graph Theory.

Examples of goal-minimally k-diametric graphs for some small values of k

Ján Plesník, 2008, Australas. J Comb..

Equivalence between the minimum covering problem and the maximum matching problem

Ján Plesník, J. Plesník, 1984, Discret. Math..

Constrained Weighted Matchings and Edge Coverings in Graphs

Ján Plesník, J. Plesník, 1999, Discret. Appl. Math..

A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments

Mirka Miller, Joseph F. Ryan, Ljiljana Brankovic, 1997, Electron. J. Comb..

Large graphs with small degree and diameter: a voltage assignment approach

Mirka Miller, Joseph F. Ryan, Ljiljana Brankovic, 1998, Australas. J Comb..

Towards minimum k-geodetically connected graphs

Ján Plesník, 2003, Networks.

Further results on almost Moore digraphs

Mirka Miller, Edy Tri Baskoro, Ján Plesník, 2000, Ars Comb..

Regular digraphs of diameter 2 and maximum order

Mirka Miller, Edy Tri Baskoro, Ján Plesník, 1994, Australas. J Comb..

An integer programming formulation of the Steiner problem in graphs

Ján Plesník, Mamadi Diané, 1993, ZOR Methods Model. Oper. Res..

A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs

Ján Plesník, J. Plesník, 1984, J. Comb. Theory, Ser. B.

A note on the complexity of finding regular subgraphs

Ján Plesník, J. Plesník, 1984, Discret. Math..

One method for proving the impossibility of certain Moore graphs

Ján Plesník, J. Plesník, 1974, Discret. Math..

The complexity of designing a network with minimum diameter

Ján Plesník, J. Plesník, 1981, Networks.

Digraphs of degree 3 and order close to the moore bound

Mirka Miller, Edy Tri Baskoro, Stefan Znám, 1995, J. Graph Theory.

Heuristics for the Steiner Problem in Graphs

Ján Plesník, 1992, Discret. Appl. Math..

Regular digraphs of diamter 2 and maximum order: Corrigenda

Mirka Miller, Edy Tri Baskoro, Stefan Znám, 1995, Australas. J Comb..

On the Structure of Digraphs with Order Close to the Moore Bound

Mirka Miller, Edy Tri Baskoro, Ján Plesník, 1998, Graphs Comb..

Bounds on chromatic numbers of multiple factors of a complete graph

Ján Plesník, 1978, J. Graph Theory.

Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph

Ján Plesník, 2001, J. Comb. Optim..

On the Extension of Graphs with a Given Diameter without Superfluous Edges

Ján Plesník, Ferdinand Gliviak, Peter Kyš, 1969 .

On minimal graphs of diameter $2$ with every edge in a $3$-cycle

Ján Plesník, 1986 .

On Some Heuristics for the Steiner Problem in Graphs

Ján Plesník, 1992 .

Two heuristics for the absolute $p$-center problem in graphs

Ján Plesník, J. Plesník, 1988 .

On the interchange heuristic for locating centers and medians in a graph

Ján Plesník, 1987 .

Two constructions of geodetic graphs

Ján Plesník, 1977 .

Diametrically critical tournaments

Ján Plesník, 1975 .