Results 51 to 60 of about 2,427,282 (299)
Spanning Plane Subgraphs of 1‐Plane Graphs
Journal of Graph TheoryABSTRACTA graph drawn on the plane is called 1‐plane if each edge is crossed at most once by another edge. In this paper, we show that every 4‐edge‐connected 1‐plane graph has a connected spanning plane subgraph. We also show that there exist infinitely many 4‐connected 1‐plane graphs that have no 2‐connected spanning plane subgraphs.
Kenta Noguchi +2 more
openaire +2 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Secondary hyperparathyroidism (SHPT) is a common complication in patients receiving maintenance dialysis, driven by calcium and phosphate metabolism disturbances. Calcimimetics are central to the management of SHPT by enhancing calcium‐sensing receptor sensitivity and reducing parathyroid hormone secretion.
Fumihiko Koiwa +3 more
wiley +1 more source
Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10
FEBS Letters, EarlyView.Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang +8 more
wiley +1 more source
Free Edge Lengths in Plane Graphs [PDF]
Proceedings of the thirtieth annual symposium on Computational geometry, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Connelly, Robert +7 more
openaire +3 more sources
Time after time – circadian clocks through the lens of oscillator theory
FEBS Letters, EarlyView.Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo +2 more
wiley +1 more source
Intersecting longest paths and longest cycles: A survey
Electronic Journal of Graph Theory and Applications, 2013 This is a survey of results obtained during the last 45 years regarding the intersection behaviour of all longest paths, or all longest cycles, in connected graphs. Planar graphs and graphs of higher connectivity receive special attention.
Ayesha Shabbir +2 more
doaj +1 more source
FEBS Letters, EarlyView.We identified a systemic, progressive loss of protein S‐glutathionylation—detected by nonreducing western blotting—alongside dysregulation of glutathione‐cycle enzymes in both neuronal and peripheral tissues of Taiwanese SMA mice. These alterations were partially rescued by SMN antisense oligonucleotide therapy, revealing persistent redox imbalance as ...
Sofia Vrettou, Brunhilde Wirth
wiley +1 more source
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
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source