Ján Plesník - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2008

Examples of goal-minimally k-diametric graphs for some small values of kJán Plesník. ajc, 41:93-106, 2008. [doi]

2004

Minimum ::::k::::-geodetically connected digraphsJán Plesník. networks, 44(4):243-253, 2004. [doi]

2003

Towards minimum k-geodetically connected graphsJán Plesník. networks, 41(2):73-82, 2003. [doi]

2001

Minimum Cost Edge Subset Covering Exactly k Vertices of a GraphJán Plesník. jco, 5(3):275-286, 2001.

2000

Further results on almost Moore digraphsEdy Tri Baskoro, Mirka Miller, Ján Plesník. arscom, 56, 2000.

1999

Constrained Weighted Matchings and Edge Coverings in GraphsJán Plesník. DAM, 92(2-3):229-241, 1999. [doi]

1998

1995

Regular digraphs of diamter 2 and maximum order: CorrigendaEdy Tri Baskoro, Mirka Miller, Ján Plesník, Stefan Znám. ajc, 12:305, 1995. [doi]

Digraphs of degree 3 and order close to the moore boundEdy Tri Baskoro, Mirka Miller, Ján Plesník, Stefan Znám. jgt, 20(3):339-349, 1995. [doi]

1994

Regular digraphs of diameter 2 and maximum orderEdy Tri Baskoro, Mirka Miller, Ján Plesník, Stephan Znám. ajc, 9:291-306, 1994. [doi]

1993

An integer programming formulation of the Steiner problem in graphsMamadi Diané, Ján Plesník. mmor, 37(1):107-111, 1993. [doi]

1992

Heuristics for the Steiner Problem in GraphsJán Plesník. DAM, 37/38:451-463, 1992. [doi]

1987

A heuristic for the p-center problems in graphsJán Plesník. DAM, 17(3):263-268, 1987. [doi]

1984

A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphsJán Plesník. JCT, 36(3):284-297, 1984. [doi]

Equivalence between the minimum covering problem and the maximum matching problemJán Plesník. DM, 49(3):315-317, 1984. [doi]

A note on the complexity of finding regular subgraphsJán Plesník. DM, 49(2):161-167, 1984. [doi]

On the sum of all distances in a graph or digraphJán Plesník. jgt, 8(1):1-21, 1984. [doi]

1981

The complexity of designing a network with minimum diameterJán Plesník. networks, 11(1):77-85, 1981. [doi]

1979

The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound TwoJán Plesník. ipl, 8(4):199-201, 1979.

1978

Bounds on chromatic numbers of multiple factors of a complete graphJán Plesník. jgt, 2(1):9-17, 1978. [doi]

1974

One method for proving the impossibility of certain Moore graphsJán Plesník. DM, 8(4):363-376, 1974. [doi]

Sign in or sign up to see more results.

runs on WebDSL