Association Between Onsite Outpatient Pharmacy Availability, Medication Fill Rates, and Readmissions in Mental Health Hospitals. [PDF]
CureusSood S +5 more
europepmc +1 more source
Journal of Dental Education, EarlyView.ABSTRACT Objectives In South Korea, dental graduates frequently incur substantial debt to establish private practices; however, formal financial education is rarely incorporated into undergraduate dental curricula. This study examines whether undergraduate dental students exhibit debt account aversion (DAA)—a cognitive bias in which small debts are ...
Junsu Park, Jungjoon Ihm
wiley +1 more source
From platform carnival to official discourse: How "truth" is produced in Chinese online news. [PDF]
PLoS OneLi J, Hu S.
europepmc +1 more source
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Utilization of imaging in the evaluation of pediatric blunt liver and spleen injury: a national trauma data bank analysis. [PDF]
Pediatr Surg IntKwak L, Wang T, Hung G, Burjonrappa S.
europepmc +1 more source
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke +3 more
wiley +1 more source
Postoperative outcomes in patients with gastric cancer undergoing prehabilitation in a high-complexity referral centre. [PDF]
World J Surg OncolSuescun Fajardo OJ +5 more
europepmc +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová +3 more
wiley +1 more source
A structured clinical nutrition pathway for enteral nutrition management in patients with intracerebral hemorrhage: a non-randomized controlled study. [PDF]
Front NutrLiu N, Zheng Y, Wen J.
europepmc +1 more source
Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch +5 more
wiley +1 more source