This study investigated the effect of technostress on university students’ wellbeing and technology-enhanced learning (TEL) through the stressor-strain-outcome model. Interviews were first used to contextualize and inform the development of the survey instrument. Then, survey data from 796 participants were collected and analyzed using partial least squares structural equation modeling. The findings indicate that technostress creators, including techno-complexity, techno-insecurity, and techno-uncertainty, were significantly associated with students’ burnout in TEL, which in turn was negatively associated with their self-regulation, learning agency, and persistence in TEL. Group comparison analyses based on gender, academic disciplines, and willingness to join TEL show that the negative associations between burnout and self-regulation, learning agency, and persistence in TEL were significantly stronger for male students than female students. Similar findings were also found for students joining TEL willingly and unwillingly, with the latter being more strongly affected by burnout. In addition, the positive association between techno-complexity and burnout was greater for students from social sciences than those from engineering and natural sciences. The findings of this study can inform future implementation decisions of TEL in higher education and strategies to preserve university students’ wellbeing.
9 April 2021 in The Electronic Journal of Combinatorics
A graph is called $1$-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let $G$ be a bipartite $1$-planar graph with $n$ ($n\ge 4$) vertices and $m$ edges. Karpov showed that $m\le 3n-8$ holds for even $n\ge 8$ and $m\le 3n-9$ holds for odd $n\ge 7$. Czap, Przybyło and Škrabul'áková proved that if the partite sets of $G$ are of sizes $x$ and $y$, then $m\le 2n+6x-12$ holds for $2\leq x\leq y$, and conjectured that $m\le 2n+4x-12$ holds for $x\ge 3$ and $y\ge 6x-12$. In this paper, we settle their conjecture and our result is even under a weaker condition $2\le x\le y$.
3 November 2022 in SIAM Journal on Discrete Mathematics
A matching of a graph is a set of edges without common end vertex. A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Recently, Biedl and Wi...
27 December 2016 in Frontiers of Mathematics in China