Ján Plesník

According to our database, Ján Plesník authored at least 23 papers between 1974 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

2008

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

Ján Plesník

Australas. J Comb., 2008

2004

Minimum <i>k</i>-geodetically connected digraphs.

Ján Plesník

Networks, 2004

2003

Towards minimum k-geodetically connected graphs.

Ján Plesník

Networks, 2003

2001

Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph.

Ján Plesník

J. Comb. Optim., 2001

2000

Further results on almost Moore digraphs.

Edy Tri Baskoro, Mirka Miller, Ján Plesník

Ars Comb., 2000

1999

Constrained Weighted Matchings and Edge Coverings in Graphs.

Ján Plesník

Discret. Appl. Math., 1999

1998

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

Edy Tri Baskoro, Mirka Miller, Ján Plesník

Graphs Comb., 1998

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

Ljiljana Brankovic, Mirka Miller, Ján Plesník, Joseph F. Ryan, Jozef Sirán

Electron. J. Comb., 1998

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

Ljiljana Brankovic, Mirka Miller, Ján Plesník, Joe Ryan, Jozef Sirán

Australas. J Comb., 1998

1995

Digraphs of degree 3 and order close to the moore bound.

Edy Tri Baskoro, Mirka Miller, Ján Plesník, Stefan Znám

J. Graph Theory, 1995

Regular digraphs of diamter 2 and maximum order: Corrigenda.

Edy Tri Baskoro, Mirka Miller, Ján Plesník, Stefan Znám

Australas. J Comb., 1995

1994

Regular digraphs of diameter 2 and maximum order.

Edy Tri Baskoro, Mirka Miller, Ján Plesník, Stephan Znám

Australas. J Comb., 1994

1993

An integer programming formulation of the Steiner problem in graphs.

Mamadi Diané, Ján Plesník

ZOR Methods Model. Oper. Res., 1993

1992

Heuristics for the Steiner Problem in Graphs.

Ján Plesník

Discret. Appl. Math., 1992

1987

A heuristic for the p-center problems in graphs.

Ján Plesník

Discret. Appl. Math., 1987

1984

On the sum of all distances in a graph or digraph.

Ján Plesník

J. Graph Theory, 1984

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

Ján Plesník

J. Comb. Theory B, 1984

Equivalence between the minimum covering problem and the maximum matching problem.

Ján Plesník

Discret. Math., 1984

A note on the complexity of finding regular subgraphs.

Ján Plesník

Discret. Math., 1984

1981

The complexity of designing a network with minimum diameter.

Ján Plesník

Networks, 1981

1979

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

Ján Plesník

Inf. Process. Lett., 1979

1978

Bounds on chromatic numbers of multiple factors of a complete graph.

Ján Plesník

J. Graph Theory, 1978

1974

One method for proving the impossibility of certain Moore graphs.

Ján Plesník

Discret. Math., 1974