Ján Plesník

23 papers Journal 23
YearRankTypeTitle / Venue / Authors
2008 J jnl
Examples of goal-minimally k-diametric graphs for some small values of k.
Australas. J Comb.
Ján Plesník
2004 J jnl
Minimum
Networks
Ján Plesník
2003 J jnl
Towards minimum k-geodetically connected graphs.
Networks
Ján Plesník
2001 J jnl
Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph.
J. Comb. Optim.
Ján Plesník
2000 J jnl
Further results on almost Moore digraphs.
Ars Comb.
Edy Tri Baskoro, Mirka Miller, Ján Plesník
1999 J jnl
Constrained Weighted Matchings and Edge Coverings in Graphs.
Discret. Appl. Math.
Ján Plesník
1998 J jnl
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments.
Electron. J. Comb.
Ljiljana Brankovic, Mirka Miller, Ján Plesník, Joseph F. Ryan, Jozef Sirán
1998 J jnl
Large graphs with small degree and diameter: a voltage assignment approach.
Australas. J Comb.
Ljiljana Brankovic, Mirka Miller, Ján Plesník, Joe Ryan, Jozef Sirán
1998 J jnl
On the Structure of Digraphs with Order Close to the Moore Bound.
Graphs Comb.
Edy Tri Baskoro, Mirka Miller, Ján Plesník
1995 J jnl
Digraphs of degree 3 and order close to the moore bound.
J. Graph Theory
Edy Tri Baskoro, Mirka Miller, Ján Plesník, Stefan Znám
1995 J jnl
Regular digraphs of diamter 2 and maximum order: Corrigenda.
Australas. J Comb.
Edy Tri Baskoro, Mirka Miller, Ján Plesník, Stefan Znám
1994 J jnl
Regular digraphs of diameter 2 and maximum order.
Australas. J Comb.
Edy Tri Baskoro, Mirka Miller, Ján Plesník, Stephan Znám
1993 J jnl
An integer programming formulation of the Steiner problem in graphs.
ZOR Methods Model. Oper. Res.
Mamadi Diané, Ján Plesník
1992 J jnl
Heuristics for the Steiner Problem in Graphs.
Discret. Appl. Math.
Ján Plesník
1987 J jnl
A heuristic for the p-center problems in graphs.
Discret. Appl. Math.
Ján Plesník
1984 J jnl
A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs.
J. Comb. Theory B
Ján Plesník
1984 J jnl
A note on the complexity of finding regular subgraphs.
Discret. Math.
Ján Plesník
1984 J jnl
Equivalence between the minimum covering problem and the maximum matching problem.
Discret. Math.
Ján Plesník
1984 J jnl
On the sum of all distances in a graph or digraph.
J. Graph Theory
Ján Plesník
1981 J jnl
The complexity of designing a network with minimum diameter.
Networks
Ján Plesník
1979 J jnl
The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two.
Inf. Process. Lett.
Ján Plesník
1978 J jnl
Bounds on chromatic numbers of multiple factors of a complete graph.
J. Graph Theory
Ján Plesník
1974 J jnl
One method for proving the impossibility of certain Moore graphs.
Discret. Math.
Ján Plesník