The following pages link to L'udovít Niepel (Q967347):
Displaying 50 items.
- (Q186118) (redirect page) (← links)
- (Q639292) (redirect page) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- Menger-type theorems with restrictions on path lengths (Q687118) (← links)
- (Q787157) (redirect page) (← links)
- Supersaturated graphs and hypergraphs (Q787158) (← links)
- Some types of clustering with relational constraints (Q789129) (← links)
- On the design of a classifier with linguistic variables as inputs (Q793514) (← links)
- Faithful consensus methods for n-trees (Q794118) (← links)
- Bounds on probability of connectedness of a random graph (Q803174) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Flatness and continuity in the percentile clustering model (Q811455) (← links)
- Efficient algorithms for decomposing graphs under degree constraints (Q881575) (← links)
- The upper envelope of piecewise linear functions: Tight bounds on the number of faces (Q919829) (← links)
- The upper envelope of piecewise linear functions: Algorithms and applications (Q919830) (← links)
- Lectures on advances in combinatorics (Q929393) (← links)
- Domination in a digraph and in its reverse (Q967348) (← links)
- The Erdős-Lovász tihany conjecture for quasi-line graphs (Q1043565) (← links)
- Embedding 5-cycle systems into pentagon triple systems (Q1044955) (← links)
- Closure, stability and iterated line graphs with a 2-factor (Q1044973) (← links)
- Large sets of extended directed triple systems with even orders (Q1045191) (← links)
- Split graphs of Dilworth number 2 (Q1063046) (← links)
- Contact patterns of equal nonoverlapping spheres (Q1068097) (← links)
- The generation of random, binary unordered trees (Q1068492) (← links)
- Testing homotopy equivalence is isomorphism complete (Q1072577) (← links)
- The complexity of generalized clique packing (Q1073049) (← links)
- A characterization of uniquely representable interval graphs (Q1073053) (← links)
- A partition of Catalan permuted sequences with applications (Q1094423) (← links)
- Graph decomposition with constraints in the minimum degree (Q1102305) (← links)
- On pancyclic line graphs (Q1102306) (← links)
- Divisible designs with \(r-\lambda{}_ 1=1\) (Q1175960) (← links)
- Classification of normalized cluster methods in an order theoretic model (Q1179260) (← links)
- Short proofs on multicommodity flows and cuts (Q1186123) (← links)
- A linear-time algorithm for finding an ambitus (Q1186786) (← links)
- Greedy algorithm compatibility and heavy-set structures (Q1193543) (← links)
- A new approach to isotonic agglomerative hierarchical clustering (Q1203108) (← links)
- Duality in graph families (Q1208357) (← links)
- On antichain intersection numbers, total clique covers and regular graphs (Q1322237) (← links)
- Clique polynomials and independent set polynomials of graphs (Q1322274) (← links)
- On solutions of Alspach's problems (Q1334078) (← links)
- Parallel algorithms for the domination problems in trapezoid graphs (Q1356505) (← links)
- Pairwise partitioning: A nonmetric algorithm for identifying feature-based similarity structures (Q1362283) (← links)
- The exact value of the harmonious chromatic number of a complete binary tree (Q1366782) (← links)
- New families of adjointly unique graphs (Q1366788) (← links)
- 2-factor Hamiltonian graphs. (Q1403914) (← links)
- Partitions of graphs with high minimum degree or connectivity. (Q1405098) (← links)
- Packing closed trails into dense graphs. (Q1405105) (← links)
- Locating-dominating sets in hypergraphs (Q1677551) (← links)
- The horocyclic Radon transform on non-homogeneous trees (Q1802748) (← links)
