We extend the notion of $P_4$-sparse graphs previously introduced by {\scshape Ho\`ang} by considering $\mathcal{F}$-sparse graphs were $\mathcal{F}$ denotes a finite set of graphs on $p$ vertices. Thus we obtain some results on $(P_5,\bar{P_5})$-sparse graphs already known on $(P_5,\bar{P_5})$-free graphs. Finally we completely describe the structure of $(P_5,\bar{P_5}, bull$)-sparse graphs, i...

Mim-width and sim-width are among the most powerful graph width parameters, with more than mim-width, which is in turn clique-width. While several NP-hard problems become tractable for classes whose mim-width bounded quickly computable, no algorithmic applications of boundedness known. In Kang et al. (2017) [32], it asked whether Independent Set 3-Colouring NP-complete on graphs at 1. We observ...

background: to investigate the association between the red cell distribution width (rdw) and mortality in patients with acute pancreatitis (ap), and to assess the ability of rdw to predict mortality in ap patients. materials and methods: this retrospective cohort study included 120 patients (50 males and 70 females) with ap who were admitted to the first affiliated hospital of zhongshan medical...