Results 111 to 120 of about 2,666,039 (345)
Odd facial total-coloring of unicyclic plane graphs [PDF]
Discrete Mathematics Letters, 2022 Július Czap
doaj +1 more source
Minor stars in plane graphs with minimum degree five
, 2018 The weight of a subgraph $H$ in $G$ is the sum of the degrees in $G$ of vertices of $H$. The {\em height} of a subgraph $H$ in $G$ is the maximum degree of vertices of $H$ in $G$.
Li, Yangfan, Rao, Mengjiao, Wang, Tao
core +1 more source
Cyclic coloring of plane graphs
Discrete Mathematics, 1992 Let \(G\) be a plane graph, and let \(x_ k(G)\) be the minimum number of colors to color the vertices of \(G\) so that every two of them which lie in the boundary of the same face of the size at most \(k\), receive different colors. \textit{O. Ore} and \textit{M. D. Plummer} [Recent Progress Combin., Proc. 3rd Waterloo Conf.
openaire +2 more sources
Molecular Oncology, EarlyView.Stemness properties, including quiescence, self‐renewal, and chemoresistance, are closely associated with leukemia relapse. Here, we demonstrate that DNA damage‐inducible transcript 4 (DDIT4) is induced in the hypoxic bone marrow niche and is essential for maintaining the stemness of AML1‐ETO9a leukemia cells.
Yishuang Li +12 more
wiley +1 more source
A Note On Vertex Colorings Of Plane Graphs
Discussiones Mathematicae Graph Theory, 2014 Given an integer valued weighting of all elements of a 2-connected plane graph G with vertex set V , let c(v) denote the sum of the weight of v ∈ V and of the weights of all edges and all faces incident with v.
Fabricia Igor +2 more
doaj +1 more source
The Clique Problem in Ray Intersection Graphs
, 2011 Ray intersection graphs are intersection graphs of rays, or halflines, in the plane. We show that any planar graph has an even subdivision whose complement is a ray intersection graph.
Cabello, Sergio +2 more
core +1 more source
Rook-Drawing for Plane Graphs [PDF]
, 2015 Motivated by visualization of large graphs, we introduce a new type of graph drawing called "rook-drawing". A rook-drawing of a graph G is obtained by placing the n nodes of G on the intersections of a regular grid, such that each row and column of the grid supports exactly one node. This paper focuses on rook-drawings of planar graphs. We first give a
Auber, David +3 more
openaire +3 more sources
Molecular Oncology, EarlyView.RKIP, a metastasis suppressor protein, modulates key oncogenic pathways in lung adenocarcinoma. In silico analyses linked low RKIP expression to poor survival. Functional studies revealed RKIP overexpression reduces tumor aggressiveness and enhances sensitivity to EGFR‐targeted therapies, while its loss promotes resistance.
Ana Raquel‐Cunha +10 more
wiley +1 more source
A note on face coloring entire weightings of plane graphs
Discussiones Mathematicae Graph Theory, 2014 Given a weighting of all elements of a 2-connected plane graph G = (V,E, F), let f(α) denote the sum of the weights of the edges and vertices incident with the face _ and also the weight of _.
Jendrol Stanislav, Šugerek Peter
doaj +1 more source
Molecular Oncology, EarlyView.PARP inhibitors are used to treat a small subset of prostate cancer patients. These studies reveal that PARP1 activity and expression are different between European American and African American prostate cancer tissue samples. Additionally, different PARP inhibitors cause unique and overlapping transcriptional changes, notably, p53 pathway upregulation.
Moriah L. Cunningham +21 more
wiley +1 more source