Results 91 to 100 of about 568,500 (305)
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
Molecular Oncology, EarlyView.Urinary LGALS3BP is elevated in bladder cancer patients compared to healthy controls as detected by the 1959 antibody–based ELISA. The antibody shows enhanced reactivity to the high‐mannose glycosylated variant secreted by cancer cells treated with kifunensine (KIF).
Asia Pece +18 more
wiley +1 more source
Graphs embedded into finite projective planes
Contributions to Discrete Mathematics, 2015 We study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs and the existence of certain substructures in a plane, such as Baer subplanes and arcs.
Mellinger, Keith +2 more
openaire +2 more sources
Survivin and Aurora Kinase A control cell fate decisions during mitosis
Molecular Oncology, EarlyView.Aurora A interacts with survivin during mitosis and regulates its centromeric role. Loss of Aurora A activity mislocalises survivin, the CPC and BubR1, leading to disruption of the spindle checkpoint and triggering premature mitotic exit, which we refer to as ‘mitotic slippage’.
Hana Abdelkabir +2 more
wiley +1 more source
Discrete Mathematics, Algorithms and ApplicationsA graph is called NIC-planar if it admits a drawing in the plane such that each edge is crossed at most once and two pairs of crossing edges share at most one vertex. A graph together with a NIC-planar drawing is a NIC-plane graph. A graph is maximal NIC-planar or NIC-plane, if we cannot add any missing edge so that the resulting graph is still NIC ...
Ding, Zongpeng +2 more
openaire +3 more sources
There are Plane Spanners of Maximum Degree 4
, 2014 Let E be the complete Euclidean graph on a set of points embedded in the plane. Given a constant t >= 1, a spanning subgraph G of E is said to be a t-spanner, or simply a spanner, if for any pair of vertices u,v in E the distance between u and v in G is ...
Bonichon, Nicolas +3 more
core +2 more sources
Molecular Oncology, EarlyView.CDK11 inhibition stabilises the tumour suppressor p53 and triggers the production of an alternative p21WAF1 splice variant p21L, through the inactivation of the spliceosomal protein SF3B1. Unlike the canonical p21WAF1 protein, p21L is localised in the cytoplasm and has reduced cell cycle‐blocking activity.
Radovan Krejcir +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
Graph States, Pivot Minor, and Universality of (X,Z)-measurements [PDF]
, 2012 The graph state formalism offers strong connections between quantum information processing and graph theory. Exploring these connections, first we show that any graph is a pivot-minor of a planar graph, and even a pivot minor of a triangular grid.
Mhalla, Mehdi, Perdrix, Simon
core +1 more source
3D Visibility Representations of 1-planar Graphs
, 2017 We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parallel to the xy-plane, and the edges are unobstructed z-parallel visibilities
A Arleo +20 more
core +1 more source