Results 231 to 240 of about 292,234 (282)
Bilayer book- like decellularized extracellular matrix scaffold with bioactive coatings for rotator cuff repair. [PDF]
Li J +9 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Book thickness of toroidal zero-divisor graphs
Afrika Matematika, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thomas McKenzie, Shannon Overbay
openaire +3 more sources
The book thickness of nilpotent graphs
Rocky Mountain Journal of Mathematics, 2022Let \(R\) be a commutative ring with nonzero identity and let \(Z_N(R)=\{y \in R: yz ~\text{is}~ \text{nilpotent for some}~z\in R^*=R \setminus \{0\} \}.\) The nilpotent graph \(\Gamma_N (R)\) of \(R\) is the graph whose vertex set coincide with \(Z_N(R)^{*}=Z_N(R)\setminus \{0\}\) and there is an edge between two distinct vertices \(x\) and \(y\) if ...
Kalaimurugan, G., Vignesh, P.
openaire +2 more sources
On Fixed-Order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering
Theoretical Computer Science, 2020Given a graph \(G=(V,E)\) and a fixed linear order \(\prec \) of V, the problem fixed-order book thickness asks whether there is a page assignment \(\sigma \) such that \(\langle \prec ,\sigma \rangle \) is a k-page book embedding of G. Recently, Bhore et al.(GD2019) presented an algorithm parameterized by the pathwidth of the vertex ordering (denoted ...
Yunlong Liu +3 more
openaire +1 more source
1-Planar Graphs have Constant Book Thickness
2015In a book embedding the vertices of a graph are placed on the “spine” of a book and the edges are assigned to “pages”, so that edges on the same page do not cross. In this paper, we prove that every 1-planar graph (that is, a graph that can be drawn on the plane such that no edge is crossed more than once) admits an embedding in a book with constant ...
Michael A. Bekos +3 more
openaire +1 more source

