Results 11 to 20 of about 18,287 (228)

Track Layouts of Graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2004
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

Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2005
A \emphk-stack layout (respectively, \emphk-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj   +1 more source

On Linear Layouts of Graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2004
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

The matching book embeddings of pseudo-Halin graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2023
The book embedding of a graph G is to arrange the set of points of the graph on a line (spine) and embed the edges on the half-plane bounded by the spine so that the edges in the same page do not intersect with each other.
Zeling Shao   +3 more
doaj   +1 more source

Four pages are indeed necessary for planar graphs

open access: yesJournal of Computational Geometry, 2020
An embedding of a graph in a book consists of a linear order of its vertices along the spine of the book and of an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The book thickness of a graph is the minimum
Michael Kaufmann   +5 more
doaj   +1 more source

Review of ‘Contributions to understanding climate interactions: stratospheric ozone’ by Gennadi Milinevsky, Asen Grytsai, Oleksandr Evtushevsky, and Andrew Klekociuk. (2022)

open access: yesУкраїнський антарктичний журнал, 2023
Review of ‘Contributions to understanding climate interactions: stratospheric ozone’ by Gennadi Milinevsky, Asen Grytsai, Oleksandr Evtushevsky, and Andrew Klekociuk.  (2022). Kyiv, Akademperiodyka, 252 pp. ISBN: 978-966-360-471-8.
S. Krakovska
doaj   +1 more source

Perancangan Ilustrasi Sampul Buku Kompilasi Folktale Lintas Budaya “Rove the Lore: The Endless Journey to Unveil the Myths”

open access: yesANDHARUPA: Jurnal Desain Komunikasi Visual & Multimedia, 2022
Abstrak Folktale adalah kejadian yang diceritakan secara turun temurun antar generasi atau karya-karya tradisional, yang dikenal, dan dimiliki setiap orang atau masyarakat. Folktale dipenuhi dengan kisah kearifan lokal, wisdom, cinta kasih, atau sebuah
Shienny Megawati Sutanto   +1 more
doaj   +1 more source

Preparation and Characterization of a Novel Decellularized Fibrocartilage "Book" Scaffold for Use in Tissue Engineering. [PDF]

open access: yesPLoS ONE, 2015
At the tendon-to-bone insertion, there is a unique transitional structure: tendon, non-calcified fibrocartilage, calcified fibrocartilage, and bone.
Liyun Guo   +6 more
doaj   +1 more source

Research of the backing technology of the book block spine

open access: yesJournal of Graphic Engineering and Design, 2020
The factors influencing the backing process of the book block spine are determined and their priorities are established. The method of backing the spine of book blocks in the production of publications by the method of perfect binding is proposed.
Svitlana Havenko   +5 more
doaj   +1 more source

Parameterized Algorithms for Book Embedding Problems

open access: yesJournal of Graph Algorithms and Applications, 2020
A $k$-page book embedding of a graph $G$ draws the vertices of $G$ on a line and the edges on $k$ half-planes (called pages) bounded by this line, such that no two edges on the same page cross. We study the problem of determining whether $G$ admits a $k$-
Sujoy Bhore   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy