Normothermic Ex Situ Machine Perfusion of Vascularized Composite Allografts with Oxygen Microcarriers for 12 Hours Using Real-Time Mitochondrial Redox Quantification. [PDF]
J Clin Med, 2023 Haug V +8 more
europepmc +1 more source
Avoiding scar tissue formation of peripheral nerves with the help of an acellular collagen matrix. [PDF]
PLoS One, 2023 Aman M +8 more
europepmc +1 more source
Treewidth of the Kneser graph and the Erdős-Ko-Rado Theorem [PDF]
, 2014 Treewidth is an important and well-known graph parameter that measures the complexity of a graph. The Kneser graph Kneser(n, k) is the graph with vertex set ([n]k), such that two vertices are adjacent if they are disjoint.
Harvey, Daniel, Wood, David; id_orcid
core +3 more sources
Hamiltonian cycles in Kneser graphs [PDF]
, 2017 In this thesis, we will discuss existence of hamiltonian cycles in Kneser graphs: graphs K(n,k) with vertex set corresponding to k-element subsets from set of n elements, and vertices will be adjacent if and only if their corresponding k-sets are ...
Hulcová, Tereza
core
Microporous Polylactic Acid Scaffolds Enable Fluorescence-Based Perfusion Imaging of Intrinsic In Vivo Vascularization. [PDF]
Int J Mol Sci, 2023 Koepple C +6 more
europepmc +1 more source
Dominating sets in Kneser graphs [PDF]
, 2007 This thesis investigates dominating sets in Kneser graphs as well as a selection of other topics related to graph domination. Dominating sets in Kneser graphs, especially those of minimum size, often correspond to interesting combinatorial incidence ...
Gorodezky, Igor
core
Equitable coloring of Kneser graphs [PDF]
, 2009 The Kneser graph K(n,k) is the graph whose vertices correspond to k-element subsets of set {1,2,...,n} and two vertices are adjacent if and only if they represent disjoint subsets. In this paper we study the problem of equitable coloring of Kneser graphs,
Żyliński, Paweł +2 more
core +1 more source
Mutual-visibility problems in Kneser and Johnson graphs [PDF]
Let G be a connected graph and X ⊆ V(G). By definition, two vertices u and v are X-visible in G if there exists a shortest u, v-path with all internal vertices being outside of the set X. The largest size of X such that any two vertices of G (resp.
Boruzanlı Ekinci, Gülnaz +3 more
core +1 more source
, 2017 Let $k,d,\lambda\ge 1$ be integers with $d\ge \lambda $. Let $m(k,d,\lambda)$ be the maximum positive integer $n$ such that every set $X$ of $n$ points (not necessarily in general position) in $\mathbb{R}^{d}$ has the property that the convex hulls of ...
Ramirez Alfonsin, Jorge
core +1 more source
Effective or Harmful-Evaluation of Locally Applied Antibiotics on Adipose Tissue during Lipofilling to the Breast-An In Vitro Study. [PDF]
Int J Mol Sci, 2023 Diehm YF +7 more
europepmc +1 more source