The following pages link to Ján Plesník (Q222481):
Displayed 50 items.
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- Generalized network design problems. Modeling and optimization. (Q455036) (← links)
- On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
- A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs (Q595678) (← links)
- On graphs in which the Hoffman bound for cocliques equals the Cvetcovich bound (Q656337) (← links)
- Spanning closed trails in graphs (Q686147) (← links)
- Connected searching of weighted trees (Q719311) (← links)
- On coloring graphs with locally small chromatic number (Q759761) (← links)
- Geodetic blocks of diameter three (Q759769) (← links)
- (Q790129) (redirect page) (← links)
- Hypergraph families with bounded edge cover or transversal number (Q790130) (← links)
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs (Q861797) (← links)
- A note on maximal nonhamiltonian Burkard-Hammer graphs (Q873804) (← links)
- Finding the orthogonal projection of a point onto an affine subspace (Q874996) (← links)
- Tree representations of graphs (Q875046) (← links)
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs (Q875943) (← links)
- On the existence of certain generalized Moore geometries. V (Q908929) (← links)
- Graphs of order two less than the Moore bound (Q924968) (← links)
- Lattice embeddings of trees (Q1024313) (← links)
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors (Q1026115) (← links)
- Heuristics for the stochastic Eulerian tour problem (Q1043339) (← links)
- A note on the complexity of finding regular subgraphs (Q1059641) (← links)
- Equivalence between the minimum covering problem and the maximum matching problem (Q1068107) (← links)
- On the regulation number of a multigraph (Q1068843) (← links)
- Increasing the minimum distance of a set of points (Q1072551) (← links)
- Partition of a bipartite Hamiltonian graph into two cycles (Q1072572) (← links)
- Hamiltonian decompositions of complete regular s-partite graphs (Q1076042) (← links)
- Open-interval graphs versus closed-interval graphs (Q1086256) (← links)
- On the existence of certain generalized Moore geometries. IV (Q1088670) (← links)
- Longest paths joining given vertices in a graph (Q1088682) (← links)
- The splitting number of the complete graph in the projective plane (Q1092916) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- Line domination in graphs (Q1092932) (← links)
- On diameter 2-critical graphs (Q1096642) (← links)
- A heuristic for the p-center problem in graphs (Q1098862) (← links)
- On the snake in the box problem (Q1113920) (← links)
- On the number of \(C_ 5's\) in a triangle-free graph (Q1124605) (← links)
- Addendum to: The complexity of regular subgraph recognition (Q1175798) (← links)
- A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameter \(d=3i -1\) with \(b_ i =1\) and \(k>2\) (Q1182424) (← links)
- On certain vertex valuations of a graph. I (Q1184911) (← links)
- Decomposing infinite graphs (Q1191914) (← links)
- \(f\)-optimal factors of infinite graphs (Q1191924) (← links)
- How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs (Q1197034) (← links)
- On Hadwiger's number---A problem of the Nordhaus-Gaddum type (Q1197037) (← links)
- Heuristics for the Steiner problem in graphs (Q1199447) (← links)
- Resolvable tree designs (Q1200005) (← links)
- (Q1230634) (redirect page) (← links)
- Minimum block containing a given graph (Q1230635) (← links)
- The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two (Q1254855) (← links)
- A note on large graphs of diameter two and given maximum degree (Q1272472) (← links)