Let P be a graph with a vertex v such that P\v is a forest, and let Q be an outerplanar graph. We prove that there exists a number p = p(P,Q) such that every 2-connected graph of path-width at leastâ€¦ (More)

This article provides an overview of barriers to self-care, patients' perceptions and understanding of their chronic illness, interviewing techniques, and approaches nurse practitioners can use toâ€¦ (More)

We prove that if a graph has a tree-decomposition of width at most w, then it has a tree-decomposition of width at most w with certain desirable properties. We will use this result in a subsequentâ€¦ (More)