The following pages link to Ján Plesník (Q222481):
Displayed 50 items.
- \(W_ v\) cycles in plane graphs (Q1900043) (← links)
- On powers of \(m\)-trapezoid graphs (Q1902905) (← links)
- A Wiener-type graph invariant for some bipartite graphs (Q1904516) (← links)
- On the total distance between nodes in tournaments (Q1916391) (← links)
- Perfect matchings in the triangular lattice (Q1917494) (← links)
- On the extraconnectivity of graphs (Q1923481) (← links)
- Bipartite graphs and digraphs with maximum connectivity (Q1923586) (← links)
- On the connectivity of unit distance graphs (Q1923783) (← links)
- Some extremal properties of the degree distance of a graph (Q1961241) (← links)
- Degree sequence conditions for maximally edge-connected graphs depending on the clique number (Q1969791) (← links)
- Pseudo-Hamiltonian-connected graphs (Q1971217) (← links)
- Almost Moore digraphs are diregular (Q1978162) (← links)
- Regular factors in regular graphs (Q2366028) (← links)
- On the relations between the parameters of graphs (Q2372398) (← links)
- Subspaces in \(d\)-bounded distance-regular graphs and their applications (Q2426435) (← links)
- Enumerations of vertex orders of almost Moore digraphs with selfrepeats (Q2463473) (← links)
- Local-edge-connectivity in digraphs and oriented graphs (Q2463907) (← links)
- \(P_{5}\)-factorization of complete bipartite graphs (Q2477391) (← links)
- Subdivided trees are integral sum graphs (Q2477401) (← links)
- The \((\alpha ,\beta ,s,t)\)-diameter of graphs: a particular case of conditional diameter (Q2506366) (← links)
- Remark on the graphs with a central symmetry (Q2541351) (← links)
- The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks (Q2572044) (← links)
- Almost all webs are not rank-perfect (Q2583128) (← links)
- A list heuristic for vertex cover (Q2643795) (← links)
- Minimum<i>k</i>-geodetically connected digraphs (Q3157033) (← links)
- (Q3325758) (← links)
- (Q3328585) (← links)
- On the sum of all distances in a graph or digraph (Q3344025) (← links)
- (Q3356329) (← links)
- (Q3517161) (← links)
- (Q3658028) (← links)
- (Q3739159) (← links)
- (Q3754020) (← links)
- (Q3771994) (← links)
- (Q3783313) (← links)
- (Q3800086) (← links)
- (Q3853670) (← links)
- (Q3875973) (← links)
- (Q3879256) (← links)
- On the computational complexity of centers locating in a graph (Q3902477) (← links)
- (Q3907583) (← links)
- The complexity of designing a network with minimum diameter (Q3910007) (← links)
- (Q3974150) (← links)
- (Q3988522) (← links)
- (Q4027188) (← links)
- An integer programming formulation of the Steiner problem in graphs (Q4031973) (← links)
- (Q4041603) (← links)
- Remarks on regular factors of regular graphs (Q4068761) (← links)
- (Q4068763) (← links)
- Diametrically critical tournaments (Q4074921) (← links)