An equitable k-partition of a graph G is collection induced subgraphs (G[V1],G[V2],…,G[Vk]) such that (V1,V2,…,Vk) partition V(G) and −1≤|Vi|−|Vj|≤1 for all 1≤i<j≤k. We prove every planar admits an 2-partition into 3-degenerate graphs, 3-partition 2-degenerate two forests one graph.

introduction: the field of stem cell biology and regenerative medicine is rapidly moving toward translation to clinical practice. stem cell therapy seems to be a new treatment option for some diseases. so, tracking the distribution of stem cells is crucial to their therapeutic use. based on this fact we labeled human mesenchymal stem cells (mscs) with 111in- oxine for the first time in our coun...

let $g=(v, e)$ be a graph. by emph{directional labeling (ord-labeling)} of an edge $x=uv$ of $g$ by an ordered $n$-tuple$(a_1,a_2,...,a_n)$, we mean a labeling of the edge $x$ such thatwe consider the label on $uv$ as $(a_1,a_2,...,a_n)$ in thedirection from $u$ to $v$, and the label on $x$ as$(a_{n},a_{n-1},...,a_1)$ in the direction from $v$ to $u$. inthis paper, we study graphs, called emph{...

INTRODUCTION To provide health care on equal terms has become a challenge for the health system. As the front line in health services, primary care has a key role to play in developing equitable health care, responsive to the needs of different population groups. Reducing inequalities in care has been a central and recurring theme in Swedish health reforms. The aim of this study is to describe ...