Results 1 to 10 of about 3,694 (192)
Non-Separating Planar Graphs [PDF]
The Electronic Journal of Combinatorics, 2021 A graph $G$ is a non-separating planar graph if there is a drawing $D$ of $G$ on the plane such that (1) no two edges cross each other in $D$ and (2) for any cycle $C$ in $D$, any two vertices not in $C$ are on the same side of $C$ in $D$. Non-separating planar graphs are closed under taking minors and are a subclass of planar graphs and a superclass ...
Dehkordi, Hooman R., Farr, Graham
openaire +2 more sources
Indeterminacy with Non-separable Utility [PDF]
Journal of Economic Theory, 2000 There are conditions under which the one sector growth model with increasing returns-to-scale displays an indeterminate equilibrium studied in the paper. This is a generalization of the Benhabib and Framer model [\textit{J. Benhabib} and \textit{R. E. A. Farmer}, J. Econ. Theory 63, No.
BENNETT, Rosalind L. +1 more
openaire +3 more sources
N-3 Polyunsaturated Fatty Acids (PUFAs) Reverse the Impact of Early-Life Stress on the Gut Microbiota [PDF]
, 2015 Supporting Information S1 File. Microbiota Data Set. NS.S, NS.LD, NS.HD stand for non-separated Saline, non-separated Low Dose, non-separated High Dose, respectively.
Cotter, Paul D. +8 more
core +5 more sources
Non-separable detachments of graphs [PDF]
Journal of Combinatorial Theory, Series B, 2001 Let \(G=(V,E)\) be a graph (loops and multiple edges permitted) and let \(r:V\to Z_+\). An \(r\)-detachment of \(G\) is a graph \(H\) whose vertices are obtained by splitting each vertex \(v\in V\) into \(r(v)\) vertices, called the pieces of \(v\); each edge \(uv\in E\) corresponds to an edge of \(H\) joining a piece of \(u\) to a piece of \(v\). An \(
Jackson, Bill, Jordán, Tibor
openaire +1 more source
Non-separation assay for glycohemoglobin [PDF]
Clinical Chemistry, 1998 Abstract The determination of glycohemoglobin [HbA1c, HbA1, or total glycohemoglobin (GHb)] has become an established procedure in the management of diabetes mellitus. Here, we describe the development of a simple, fluorescence, non-separation assay for the percentage of GHb (%GHb).
S, Blincko, R, Edwards
openaire +2 more sources
Localized bases for finite dimensional homogenization approximations with non-separated scales and high-contrast [PDF]
, 2010 We construct finite-dimensional approximations of solution spaces of divergence form operators with $L^\infty$-coefficients. Our method does not rely on concepts of ergodicity or scale-separation, but on the property that the solution space of these ...
Owhadi, Houman, Zhang, Lei
core +3 more sources
The Riesz basis property of an indefinite Sturm-Liouville problem with non-separated boundary conditions [PDF]
, 2013 We consider a regular indefinite Sturm-Liouville eigenvalue problem \{$-f" + q f = \lambda r f$} on $[a,b]$ subject to general self-adjoint boundary conditions and with a weight function $r$ which changes its sign at finitely many, so-called turning ...
Fleige, Andreas +2 more
core +3 more sources
Generalizing the GAGA Principle [PDF]
, 2011 This paper generalizes the fundamental GAGA results of Serre cite{MR0082175} in three ways---to the non-separated setting, to stacks, and to families.
Alper +35 more
core +1 more source
Formal GAGA for good moduli spaces [PDF]
, 2015 We prove formal GAGA for good moduli space morphisms under an assumption of "enough vector bundles" (which holds for instance for quotient stacks). This supports the philosophy that though they are non-separated, good moduli space morphisms largely ...
Geraschenko, Anton, Zureick-Brown, David
core +1 more source
Non-Separable and Planar Graphs [PDF]
Transactions of the American Mathematical Society, 1931 Introduction. In this paper the structure of graphs is studied by purely combinatorial methods. The concepts of rank and nullity are fundamental. The first part is devoted to a general study of non-separable graphs. Conditions that a graph be non-separable are given; the decomposition of a separable graph into its non-separable parts is studied; by ...
openaire +4 more sources