Results 211 to 220 of about 285,330 (265)

Parent-to-parent recommendations for coping with congenital heart disease: a mixed-methods study. [PDF]

Arch Dis Child
Callahan KP, Dorner R, Jaworski M, Capaci L, Janvier A, Maltais K, Barsoum C, Martin C, Backes CH, Luu TM.   +9 more
europepmc   +1 more source

Democratising health and social care research through long-term public involvement and engagement: a qualitative process evaluation of the Community Research and Engagement Network (CoREN). [PDF]

Res Involv Engagem
Dodd S, Khan K, Gill B, Panagaki K, Doherty A, Garrett H, Cloke J.   +6 more
europepmc   +1 more source

The gut-liver axis: connecting carotenoids to non-alcoholic fatty liver disease prevention-a promising pathway for future research. [PDF]

Hepatobiliary Surg Nutr
Xie W.
europepmc   +1 more source

Epidemiological profile and risk factors of acute appendicitis in India. [PDF]

Bioinformation
Kailasia Y, Jain S, Garg A.
europepmc   +1 more source

Global Research and Action Agenda for Climate Change and Mental Health

Lawrance E, Vay JNL, Ajlouni Y, Ali S, Yongabi KA, Aruta JJB, Bailey M, Belkin G, Clayton S, Collins P, Santos Md, Eissa M, Omrani OE, Faciolince M, Greaves N, Guinto R, Hayes K, Hill K, Jennings N, Lekwa H, Maharaj S, Massazza A, Minor K, Misha F, Modi T, Nasar S, Otto F, Pressburger L, Qudah M, Ridout M, Trisos C, Vercammen A, Watson D, Wray B, Wright S, Zeitz L.   +35 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Embedding connected factorizations

Journal of Combinatorial Theory, Series B, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amin Bahmanian, Anna Johnsen, Stefan Napirata   +2 more
openaire   +1 more source

Connected [ a , b ]-factors in Graphs

Combinatorica, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mekkia Kouider, Maryvonne Mahéo
openaire   +1 more source

Connected (g, f)‐factors

Journal of Graph Theory, 2001
AbstractIn this paper we study connected (g, f)‐factors. We describe an algorithm to connect together an arbitrary spanning subgraph of a graph, without increasing the vertex degrees too much; if the algorithm fails we obtain information regarding the structure of the graph. As a consequence we give sufficient conditions for a graph to have a connected
Mark N. Ellingham, Yunsun Nam, Heinz-Jürgen Voss   +2 more
openaire   +1 more source