Zobrazeno 1 - 10
of 64
pro vyhledávání: '"Ruth Haas"'
Autor:
Heather Iles-Smith, Linda McGowan, Julie Wood, Isobel May McMillan, Trina Evans-Cheung, Ruth Haas Eckersley, Margaret Russell, Robyn Emelda McCarthy, Lyndsey Rosson, Liz Doxford-Hook
Publikováno v:
BMJ Open, Vol 13, Iss 10 (2023)
Introduction Urinary incontinence (UI) is associated with increasing age and is more frequently experienced by women. Despite 40% prevalence in the community, little is known about the prevalence/incidence of UI in older women during hospital admissi
Externí odkaz:
https://doaj.org/article/72b74684ad32485eb13d38f4e73e97d4
Autor:
Isobel McMillan, Lyndsay Hill, Robyn McCarthy, Ruth Haas-Eckersley, Margaret Russell, Julie Wood, Liz Doxford-Hook, Yu Fu, Linda McGowan, Heather Iles-Smith
Publikováno v:
Women's Health, Vol 19 (2023)
Background: Up to 40% of older women living in the community experience urinary incontinence. In community settings, urinary incontinence impacts the quality of life, morbidity, and mortality rates. However, little is known about urinary incontinence
Externí odkaz:
https://doaj.org/article/7bb574c55be545829b00e576a7ac86ce
Autor:
sarah-marie belcastro, Ruth Haas
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 10, Iss 1 (2022)
We consider the question of when a triangulation with a Grünbaum coloring can be edge-colored with three colors such that the non-facial 3-cycles also receive all three colors; we will call this a strong Grünbaum coloring. It turns out that for the
Externí odkaz:
https://doaj.org/article/3fa39c6b5ad4478fa0401cf52116425a
Autor:
Ruth Haas, Gary MacGillivray
Publikováno v:
Algorithms, Vol 11, Iss 4, p 40 (2018)
A k-colouring of a graph G with colours 1 , 2 , … , k is canonical with respect to an ordering π = v 1 , v 2 , … , v n of the vertices of G if adjacent vertices are assigned different colours and, for 1 ≤ c ≤ k , whenever colour c is assigne
Externí odkaz:
https://doaj.org/article/784ad1a47615484392c426d4eb5e2b59
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Discrete Applied Mathematics. 329:126-139
This paper begins the study of reconfiguration of zero forcing sets, and more specifically, the zero forcing graph. Given a base graph $G$, its zero forcing graph, $\mathscr{Z}(G)$, is the graph whose vertices are the minimum zero forcing sets of $G$
Autor:
Ruth Haas
Publikováno v:
motorik. 46:69-73
Autor:
Ruth Haas
Publikováno v:
motorik. 46:93-95
Autor:
Ruth Haas
Publikováno v:
motorik. 46:57
Autor:
J. B. Collins, Ruth Haas, Aloysius G. Helminck, Jessie Lenarz, Kristine Engel Pelatt, Silvia Saccon, Matthew Welz
Publikováno v:
Communications in Algebra. 48:2293-2306