Results 61 to 70 of about 391,866 (285)
UNIFORM SPANNING FORESTS OF PLANAR GRAPHS
Forum of Mathematics, Sigma, 2019 We prove that the free uniform spanning forest of any bounded degree proper plane graph is connected almost surely, answering a question of Benjamini, Lyons, Peres and Schramm.
TOM HUTCHCROFT, ASAF NACHMIAS
doaj +1 more source
Colorings of Plane Graphs Without Long Monochromatic Facial Paths
Discussiones Mathematicae Graph Theory, 2021 Let G be a plane graph. A facial path of G is a subpath of the boundary walk of a face of G. We prove that each plane graph admits a 3-coloring (a 2-coloring) such that every monochromatic facial path has at most 3 vertices (at most 4 vertices).
Czap Július +2 more
doaj +1 more source
Bipartite partial duals and circuits in medial graphs
, 2012 It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented circuits in its
A Asratian +18 more
core +2 more sources
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
FEBS Letters, EarlyView.Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz +11 more
wiley +1 more source
-shaped point set embeddings of high-degree plane graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A point set embedding of a given plane graph on a given point set on a plane is a drawing of where each vertex is drawn on a point in . An orthogonal point set embedding of a plane graph is a point set embedding of such that each edge is drawn as a ...
Shaheena Sultana, Md. Saidur Rahman
doaj +1 more source
Orderly Spanning Trees with Applications
, 2002 We introduce and study the {\em orderly spanning trees} of plane graphs. This algorithmic tool generalizes {\em canonical orderings}, which exist only for triconnected plane graphs.
Ching-Chi Lin +3 more
core +1 more source
Decomposing plane cubic graphs
European Journal of Combinatorics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kenta Ozeki, Dong Ye
openaire +2 more sources
An isoform of 14‐3‐3 protein regulates transbilayer lipid movement at the plasma membrane
FEBS Letters, EarlyView.Loss of 14‐3‐3ζ in CHO cells confers resistance to exogenous phosphatidylserine (PS) and impairs endocytosis‐independent inward flip‐flop of fluorescent PS at the plasma membrane. RNAi‐mediated knockdown reproduces this defect, while no additive effect is seen in ATP11C‐deficient cells.
Akiko Yamaji‐Hasegawa +3 more
wiley +1 more source
On the Circumference of 3-Connected Cubic Triangle-Free Plane Graphs
Journal of Mathematics, 2021 The circumference of a graph G is the length of a longest cycle in G, denoted by cirG. For any even number n, let cn = min {cirG|G is a 3-connected cubic triangle-free plane graph with n vertices}. In this paper, we show that an upper bound of cn is n+1−
Adthasit Sinna +2 more
doaj +1 more source
On String Graph Limits and the Structure of a Typical String Graph [PDF]
, 2014 We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs.
Janson, Svante, Uzzell, Andrew J.
core