The following pages link to Peter Horák (Q215558):
Displaying 50 items.
- (Q322182) (redirect page) (← links)
- An application of combinatorics in cryptography (Q322183) (← links)
- On graphs with many cycles (Q397129) (← links)
- Longest partial transversals in plexes (Q404534) (← links)
- On quasigroups with few associative triples (Q420637) (← links)
- The intersection numbers of KTSs with a common parallel class (Q449131) (← links)
- On a mnemonic construction of permutations (Q515400) (← links)
- Every graph is \((2,3)\)-choosable (Q519997) (← links)
- A generalization of plexes of Latin squares (Q533756) (← links)
- The chromatic number of almost stable Kneser hypergraphs (Q543913) (← links)
- On critical trees labeled with a condition at distance two (Q556846) (← links)
- On bipartite distance-regular graphs with a strongly closed subgraph of diameter three (Q607010) (← links)
- On the unimodality of independence polynomials of some graphs (Q607359) (← links)
- Optimal guard sets and the Helly property (Q607361) (← links)
- Large joints in graphs (Q607362) (← links)
- Non-separating subgraphs after deleting many disjoint paths (Q618034) (← links)
- Hypergraphs with independent neighborhoods (Q653790) (← links)
- Linear algebra methods for Forbidden configurations (Q653981) (← links)
- The existence spectrum for \((3,\lambda)\)-GDDs of type \(g^t u^1\) (Q658058) (← links)
- Latin directed triple systems (Q658105) (← links)
- Non-periodic tilings of \({\mathbb{R}}^{n}\) by crosses (Q664545) (← links)
- Fractional covers and matchings in families of weighted \(d\)-intervals (Q681591) (← links)
- Compatible Hamilton cycles in Dirac graphs (Q681601) (← links)
- On a class of kernel-perfect and kernel-perfect-critical graphs (Q685562) (← links)
- Connectivity of Kautz networks (Q685656) (← links)
- Subtree and substar intersection numbers (Q686262) (← links)
- Cycles in 2-connected graphs (Q705891) (← links)
- Enumerating and decoding perfect linear Lee codes (Q735017) (← links)
- Decomposition of k-ary relations (Q751668) (← links)
- A class of dimension-skipping graphs (Q761472) (← links)
- (Q791531) (redirect page) (← links)
- Induced forests in cubic graphs (Q791532) (← links)
- Connectivity of generalized prisms over G (Q804591) (← links)
- On the connectedness of some geometric graphs (Q804592) (← links)
- Label-connected graphs and the gossip problem (Q804593) (← links)
- Solution of two problems of P. Erdős concerning Hamiltonian cycles (Q810050) (← links)
- Extremal graphs for blow-ups of stars and paths (Q827605) (← links)
- Fast decoding of quasi-perfect Lee distance codes (Q851766) (← links)
- Latin trades on three or four rows (Q856846) (← links)
- New exact values of the maximum size of graphs free of topological complete subgraphs (Q870962) (← links)
- Intersection families and Snevily's conjecture (Q872042) (← links)
- Harary index and some Hamiltonian properties of graphs (Q896102) (← links)
- On Alspach's conjecture (Q911616) (← links)
- Strong edge-magic graphs of maximum size (Q924958) (← links)
- Growing perfect cubes (Q941376) (← links)
- On covering vertices of a graph by trees (Q941380) (← links)
- On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number (Q963818) (← links)
- On Barnette's conjecture (Q968428) (← links)
- (Q1003601) (redirect page) (← links)
- Tilings in Lee metric (Q1003602) (← links)
