Results 31 to 40 of about 170,454 (272)
Treewidth 2 in the Planar Graph Product Structure Theorem [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe prove that every planar graph is contained in $H_1\boxtimes H_2\boxtimes K_2$ for some graphs $H_1$ and $H_2$ both with treewidth 2. This resolves a question of Liu, Norin and Wood [arXiv:2410.20333]. We also show this result is best possible: for any
Marc Distel +4 more
doaj +1 more source
Molecular Oncology, EarlyView.Large multidimensional digital images of cancer tissue are becoming prolific, but many challenges exist to automatically extract relevant information from them using computational tools. We describe publicly available resources that have been developed jointly by expert and non‐expert computational biologists working together during a virtual hackathon
Sandhya Prabhakaran +16 more
wiley +1 more source
Planar graphs as distinguished graph of Morse flows on the 2-disk [PDF]
arXiv, 2023 To investigate the topological structure of Morse flows on the 2-disk we use the planar graphs as destinguished graph of the flow. We assume, that the flow is transversal to the boundary of the 2-disk. We give a list of all planar graph with at least 3 edges and describe all planar graphs with 4 edges.
arxiv
Molecular Oncology, EarlyView.Dual targeting of AKT and mTOR using MK2206 and RAD001 reduces tumor burden in an intracardiac colon cancer circulating tumor cell xenotransplantation model. Analysis of AKT isoform‐specific knockdowns in CTC‐MCC‐41 reveals differentially regulated proteins and phospho‐proteins by liquid chromatography coupled mass spectrometry. Circulating tumor cells
Daniel J. Smit +19 more
wiley +1 more source
Molecular Oncology, EarlyView.This article advocates integrating temporal dynamics into cancer research. Rather than relying on static snapshots, researchers should increasingly consider adopting dynamic methods—such as live imaging, temporal omics, and liquid biopsies—to track how tumors evolve over time.
Gautier Follain +3 more
wiley +1 more source
Enumerating Hamiltonian Cycles in a Planar Graph Using Combinatorial Cycle Bases
Journal of Applied Computer Science & Mathematics, 2016 Cycle bases belong to a k-connected simple graph used both for listing and enumerating Hamiltonian cycles contained in a planar graph. Planar cycle bases have a weighted induced graph whose weight values limited to 1.
Retno MAHARESI
doaj +1 more source
Homomorphisms of planar signed graphs to signed projective cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We conjecture that every signed graph of unbalanced girth 2g, whose underlying graph is bipartite and planar, admits a homomorphism to the signed projective cube of dimension 2g1.
Reza Naserasr +2 more
doaj +1 more source
Identification of inhibitors of the Salmonella FraB deglycase, a drug target
FEBS Open Bio, EarlyView.A high‐throughput screen was used to identify inhibitors of Salmonella FraB, a drug target. Characterization of top hits (identified after an additional counter screen) revealed that some triazolidines, thiadiazolidines, and triazolothiadiazoles are mixed‐type inhibitors of FraB.
Jamison D. Law +6 more
wiley +1 more source
On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords
Discussiones Mathematicae Graph Theory, 2019 A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that every 1-planar graph with maximum degree ∆ ≥ 8 is edge-colorable with ∆ colors if each of its 5-cycles contains ...
Sun Lin, Wu Jianliang
doaj +1 more source
On (p, 1)-Total Labelling of Some 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2021 A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that the (p, 1)-total labelling number (p ≥ 2) of every 1-planar graph G is at most Δ(G) + 2p − 2 provided that Δ (G) ≥
Niu Bei, Zhang Xin
doaj +1 more source