Results 211 to 220 of about 668,534 (292)

Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree

Journal of Graph Theory, EarlyView.
ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) $\text{fas}(D)$ denote the minimum size of a feedback arc set in an oriented multigraph D $D$. In several papers, upper bounds for fas ( D ) $\text{fas}(D)$ were obtained for oriented multigraphs D $D$ with maximum degree upper‐bounded by a constant ...
Gregory Gutin, Hui Lei, Anders Yeo, Yacong Zhou   +3 more
wiley   +1 more source

Homogenised balance equations for nematic liquid crystal flow in elastic porous media. [PDF]

Z Angew Math Phys
Alwady M, Mottram NJ, Penta R.
europepmc   +1 more source

On Oriented Colourings of Graphs on Surfaces

Journal of Graph Theory, EarlyView.
ABSTRACT For an oriented graph G $G$, the least number of colours required to oriented colour G $G$ is called the oriented chromatic number of G $G$ and denoted χ o ( G ) ${\chi }_{o}(G)$. For a non‐negative integer g $g$ let χ o ( g ) ${\chi }_{o}(g)$ be the least integer such that χ o ( G ) ≤ χ o ( g ) ${\chi }_{o}(G)\le \unicode{x0200A}{\chi }_{o}(g)
Alexander Clow
wiley   +1 more source

Fractional List Packing for Layered Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source

A practical guide to characterising ecological coexistence. [PDF]

Biol Rev Camb Philos Soc
Clark AT, Shoemaker LG, Arnoldi JF, Barabás G, Germain R, Godoy O, Hallett L, Karakoç C, Saavedra S, Schreiber SJ.   +9 more
europepmc   +1 more source

A Coarse Geometric Approach to Graph Layout Problems

Journal of Graph Theory, EarlyView.
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang, David Hume, Samuel J. Kelly, Ryan Lam   +3 more
wiley   +1 more source

New conditions for stability of multiple delayed Cohen-Grossberg Neural Networks of neutral-type. [PDF]

PLoS One
Ozcan N.
europepmc   +1 more source

Towards Clinical Translation of Intravoxel Incoherent Motion MRI: Acquisition and Analysis Consensus Recommendations

Journal of Magnetic Resonance Imaging, EarlyView.
ABSTRACT Intravoxel incoherent motion (IVIM) MRI allows for simultaneous assessment of tissue microcirculation (perfusion) and diffusion of water. In single‐center studies, IVIM has shown great potential for diagnosis, treatment outcome prediction, and treatment monitoring for many different diseases and organs.
Eric E. Sigmund, Susanne S. Rauh, Mami Iima, Christian Federau, Diego Hernando, Oscar Jalnefjord, Jacobus F. A. Jansen, Jonas Jasse, Neil Peter Jerome, Misha P. T. Kaandorp, Sila Kurugol, Frederik B. Laun, Mira M. Liu, Alexandra Ljimani, Thoralf Niendorf, David A. Reiter, Mohammed Salman Shazeeb, Amita Shukla‐Dave, Julia Stabinska, Andreas Wetscherek, Peter T. While, Dan Wu, Denis Le Bihan, Oliver J. Gurney‐Champion   +23 more
wiley   +1 more source

Universal work extraction in quantum thermodynamics. [PDF]

Nat Commun
Watanabe K, Takagi R.
europepmc   +1 more source