The following pages link to Ján Plesník (Q222481):
Displayed 50 items.
- On the existence of \((d,k)\)-digraphs (Q1292845) (← links)
- Extraconnectivity of \(s\)-geodetic digraphs and graphs (Q1296969) (← links)
- On a characterization of Gauss codes (Q1302047) (← links)
- Constrained weighted matchings and edge coverings in graphs (Q1304484) (← links)
- Regular factors in vertex-deleted subgraphs of regular graphs (Q1331993) (← links)
- Strong LP duality in weighted infinite bipartite graphs (Q1332441) (← links)
- Minimizing and maximizing the diameter in orientations of graphs (Q1340120) (← links)
- On the sum of all distances in composite graphs (Q1343276) (← links)
- The minimum forcing number for the torus and hypercube (Q1348133) (← links)
- The minimum number of edges in a vertex diameter-2-critical graph (Q1356444) (← links)
- Extraconnectivity of graphs with large minimum degree and girth (Q1356447) (← links)
- LexBFS-orderings and powers of chordal graphs (Q1363684) (← links)
- S-antipodal graphs (Q1366920) (← links)
- On the average Steiner distance of graphs with presribed properties (Q1372733) (← links)
- Extremal values for ratios of distances in trees (Q1377615) (← links)
- On the order and size of \(s\)-geodetic digraphs with given connectivity (Q1377819) (← links)
- Connectivity of large bipartite digraphs and graphs (Q1377820) (← links)
- A note on constructing large Cayley graphs of given degree and diameter by voltage assignments (Q1379133) (← links)
- On the structure of digraphs with order close to the Moore bound (Q1393025) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- Robust discrete optimization and network flows (Q1424278) (← links)
- On optimal orientations of \(G\) vertex-multiplications (Q1567670) (← links)
- Spectral characterizations of the Lovász number and the Delsarte number of a graph (Q1592957) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Strong branchwidth and local transversals (Q1764812) (← links)
- The restrictive \(H\)-coloring problem (Q1764813) (← links)
- A 1-factorization of the iterated line graphs of regular graphs (Q1801745) (← links)
- Factorizations of product graphs into cycles of uniform length (Q1805375) (← links)
- Vertex-symmetric digraphs with small diameter (Q1805459) (← links)
- A note on the semi-strong perfect graph conjecture (Q1820169) (← links)
- Bipartite graphs can have any number of independent sets (Q1823265) (← links)
- The average connectivity of a digraph (Q1827842) (← links)
- Digraphs of degree two which miss the Moore bound by two (Q1841909) (← links)
- Using minimum degree to bound average distance (Q1841923) (← links)
- One method for proving the impossibility of certain Moore graphs (Q1845742) (← links)
- A note on the ultimate categorical matching in a graph (Q1849960) (← links)
- Almost minimum diameter orientations of semicomplete multipartite and extended digraphs (Q1865138) (← links)
- Boundary vertices in graphs (Q1869215) (← links)
- Sensitivity analysis to the value of \(p\) of the \({\ell}_p\) distance Weber problem (Q1872031) (← links)
- Minisum location with closest Euclidean distances (Q1872032) (← links)
- Disk embeddings of planar graphs (Q1879252) (← links)
- The power of priority algorithms for facility location and set cover (Q1884771) (← links)
- Range of diameters of a bipartite graph and its generalized 2-partite complement (Q1886885) (← links)
- Minimum average distance of strong orientations of graphs (Q1887055) (← links)
- Dense graphs without 3-regular subgraphs (Q1892830) (← links)
- Regular graphs, regular factors, and the impact of Petersen's theorems (Q1893482) (← links)
- Edge isoperimetric theorems for integer point arrays (Q1893693) (← links)
- Proper and unit tolerance graphs (Q1894354) (← links)
- Zigging and zagging in pentachains (Q1894794) (← links)