Results 111 to 120 of about 10,813,555 (336)

The Orchard crossing number of an abstract graph

open access: yes, 2009
We introduce the Orchard crossing number, which is defined in a similar way to the well-known rectilinear crossing number. We compute the Orchard crossing number for some simple families of graphs. We also prove some properties of this crossing number.
Abstract Graph, David Garber, Elie Feder
core   +2 more sources

Hypohamiltonian Graphs and their Crossing Number

open access: yesElectronic Journal of Combinatorics, 2012
We prove that for every $k \ge 0$ there is an integer $n_0(k)$ such that, for every $n \ge n_0$, there exists a hypohamiltonian graph which has order $n$ and crossing number $k$.
C. Zamfirescu
semanticscholar   +1 more source

Clinical applications of next‐generation sequencing‐based ctDNA analyses in breast cancer: defining treatment targets and dynamic changes during disease progression

open access: yesMolecular Oncology, EarlyView.
Circulating tumor DNA (ctDNA) offers a possibility for different applications in early and late stage breast cancer management. In early breast cancer tumor informed approaches are increasingly used for detecting molecular residual disease (MRD) and early recurrence. In advanced stage, ctDNA provides a possibility for monitoring disease progression and
Eva Valentina Klocker   +14 more
wiley   +1 more source

Crossing numbers of meshes [PDF]

open access: yes, 1996
We prove that the crossing number of the cartesian product of 2 cycles, Cm× Cn, m≤n, is of order Ω(mn), improving the best known lower bound. In particular we show that the crossing number of Cm×Cn is at least mn/90, and for n=m, m+1 we reduce the constant 90 to 6.
Farhad Shahrokhi   +3 more
openaire   +2 more sources

Circulating tumor cells in metastatic breast cancer patients treated with immune checkpoint inhibitors – a biomarker analysis of the ALICE and ICON trials

open access: yesMolecular Oncology, EarlyView.
In this explorative biomarker analysis, we assessed serial sampling of circulating tumor cells (CTCs) with CellSearch in two randomized trials testing immune checkpoint inhibitors (ICIs) in metastatic breast cancer. Our data demonstrate a prognostic potential of CTCs, most apparent 4 weeks into ICI therapy.
Nikolai Kragøe Andresen   +13 more
wiley   +1 more source

A Karnaugh-Map based fingerprint minutiae extraction method [PDF]

open access: yesSongklanakarin Journal of Science and Technology (SJST), 2010
Fingerprint is one of the most promising method among all the biometric techniques and has been used for thepersonal authentication for a long time because of its wide acceptance and reliability.
Sunil Kumar Singla, Ajat Shatru Arora
doaj  

The Crossing Numbers of Products of Path with Graphs of Order Six

open access: yesDiscussiones Mathematicae Graph Theory, 2013
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G⃞Pn for all connected graphs G on five vertices are also known.
Klešč Marián, Petrillová Jana
doaj   +1 more source

Nonplanarity of Iterated Line Graphs

open access: yesJournal of Mathematics, 2020
The 1-crossing index of a graph G is the smallest integer k such that the kth iterated line graph of G has crossing number greater than 1. In this paper, we show that the 1-crossing index of a graph is either infinite or it is at most 5.
Jing Wang
doaj   +1 more source

Cell‐free and extracellular vesicle microRNAs with clinical utility for solid tumors

open access: yesMolecular Oncology, EarlyView.
Cell‐free microRNAs (cfmiRs) are small‐RNA circulating molecules detectable in almost all body biofluids. Innovative technologies have improved the application of cfmiRs to oncology, with a focus on clinical needs for different solid tumors, but with emphasis on diagnosis, prognosis, cancer recurrence, as well as treatment monitoring.
Yoshinori Hayashi   +6 more
wiley   +1 more source

Monotone Crossing Number [PDF]

open access: yes, 2012
The monotone crossing number of G is defined as the smallest number of crossing points in a drawing of G in the plane, where every edge is represented by an x-monotone curve, that is, by a connected continuous arc with the property that every vertical line intersects it in at most one point.
Géza Tóth, nos Pach
openaire   +2 more sources

Home - About - Disclaimer - Privacy