Results 21 to 30 of about 18,753 (252)
On the Book Thickness of 1-Planar Graphs
In a book embedding of a graph G, the vertices of G are placed in order along a straight-line called spine of the book, and the edges of G are drawn on a set of half-planes, called the pages of the book, such that two edges drawn on a page do not cross each other. The minimum number of pages in which a graph can be embedded is called the book-thickness
Md. Jawaherul Alam +2 more
openaire +2 more sources
Editorial for the Special Issue: “Ten Years of Remote Sensing at Barcelona Expert Center”
This book celebrates the ten year anniversary of the Barcelona Expert Center by presenting recent contributions related to the topics on which the team has been working during those years.
Justino Martínez +3 more
doaj +1 more source
Upper Pedicle Breast Flap [PDF]
Introduction: Here we propose a tactic to fill the upper poles of breasts that are emptied by ptosis in primary and secondary cases to obtain anatomically beautiful breasts with sufficient breast volume.
Antônio Roberto Bozola +1 more
doaj +1 more source
A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović +2 more
doaj +1 more source
The methodology for calculating book backbones
The article describes the methods of calculating the width of book back. One of the calculation methods used in the printing house was tested. On the basis of the experimental data, the calculation formula is proposed.
Rūta Alūzienė, Jonas Sidaravičius
doaj +1 more source
Background Ultrasonography (US) is recently used frequently as a tool for airway assessment prior to intubation (endotracheal tube (ETT) placement), and several indicators have been proposed in studies with different reported performances in this regard.
Mehran Sotoodehnia +4 more
doaj +1 more source
On Linear Layouts of Graphs [PDF]
In a total order of the vertices of a graph, two edges with no endpoint in common can be \emphcrossing, \emphnested, or \emphdisjoint. A \emphk-stack (respectively, \emphk-queue, \emphk-arch) \emphlayout of a graph consists of a total order of the ...
Vida Dujmović, David R. Wood
doaj +1 more source
For the production of book products of intensive and long-term use, providing durability and durability of adhesive joints of the roots of book blocks, seamed threads, creates grounds for observance of the basic indicators of operational reliability of ...
Олександр Олександрович Палюх
doaj +1 more source
The peatland map of Europe [PDF]
Based on the ‘European Mires Book’ of the International Mire Conservation Group (IMCG), this article provides a composite map of national datasets as the first comprehensive peatland map for the whole of Europe. We also present estimates of the extent of
F. Tanneberger +4 more
doaj +1 more source
Matching Book Thickness of Halin Graphs
The proof in the manuscripts can be ...
Shao, Zeling, Geng, Huiru, Li, Zhiguo
openaire +2 more sources

