Results 91 to 100 of about 391,866 (285)
Odd facial total-coloring of unicyclic plane graphs [PDF]
Discrete Mathematics Letters, 2022 Július Czap
doaj +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
Correlation of the differential expression of PIK3R1 and its spliced variant, p55α, in pan‐cancer
Molecular Oncology, EarlyView.PIK3R1 undergoes alternative splicing to generate the isoforms, p85α and p55α. By combining large patient datasets with laboratory experiments, we show that PIK3R1 spliced variants shape cancer behavior. While tumors lose the protective p85α isoform, p55α is overexpressed, changes linked to poorer survival and more pronounced in African American ...
Ishita Gupta +10 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
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe algorithm of Tutte for constructing convex planar straight-line drawings and the algorithm of Floater and Gotsman for constructing planar straight-line morphs are among the most popular graph drawing algorithms.
Giuseppe Di Battista, Fabrizio Frati
doaj +1 more source
Chord Diagrams and Gauss Codes for Graphs [PDF]
, 2006 Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others.
Fleming, Thomas, Mellor, Blake
core +3 more sources
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.In this explorative study, the abundance of circular RNA molecules in bone marrow stem cells was found to be elevated in patients with high‐risk myelodysplastic neoplasms, and to be associated with an increased risk of progression to acute myeloid leukemia.
Eileen Wedge +17 more
wiley +1 more source
The total face irregularity strength of some plane graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A face irregular total -labeling of a 2-connected plane graph is a labeling of vertices and edges such that their face-weights are pairwise distinct. The weight of a face under a labeling is the sum of the labels of all vertices and edges surrounding ...
Meilin I. Tilukay +3 more
doaj +1 more source
, 2005 We show that a complete embedded maximal surface in the 3-dimensional Lorentz-Minkowski space $L^3$ with a finite number of singularities is, up to a Lorentzian isometry, an entire graph over any spacelike plane asymptotic to a vertical half catenoid or ...
Fernandez, Isabel +2 more
core +1 more source