Results 1 to 10 of about 3,543,110 (254)
Matching book thickness of generalized Petersen graphs
Electronic Journal of Graph Theory and Applications, 2022 The matching book embedding of a graph G is to place its vertices on the spine, and arrange its edges on the pages so that the edges in the same page do not intersect each other and the edges induced subgraphs of each page are 1-regular.
Zeling Shao, Huiru Geng, Zhiguo Li
semanticscholar +3 more sources
Discrete 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 ...
Dujmovic, Vida +2 more
core +5 more sources
On the Book Thickness of k-Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Every k-tree has book thickness at most k + 1, and this bound is best possible for all k \textgreater= 3. Vandenbussche et al. [SIAM J. Discrete Math., 2009] proved that every k-tree that has a smooth degree-3 tree decomposition with width k has book ...
D. Wood, V. Dujmović
semanticscholar +3 more sources
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages [PDF]
International Symposium on Computational Geometry, 2020 An embedding of a graph in a book, called book embedding, consists of a linear ordering of its vertices along the spine of the book and an assignment of its edges to the pages of the book, so that no two edges on the same page cross.
Bekos, Michael A. +5 more
core +2 more sources
On the Upward Book Thickness Problem: Combinatorial and Complexity Results [PDF]
International Symposium Graph Drawing and Network Visualization, 2021 A long-standing conjecture by Heath, Pemmaraju, and Trenk states that the upward book thickness of outerplanar DAGs is bounded above by a constant. In this paper, we show that the conjecture holds for subfamilies of upward outerplanar graphs, namely ...
S. Bhore +3 more
semanticscholar +1 more source
Validation of The Reading House and Association With Cortical Thickness
Pediatrics, 2021 This is an expanded validation of TRH, a children’s book for screening emergent literacy skills in preschool-aged children, involving cognitive measures and cortical thickness.
John S. Hutton +6 more
semanticscholar +1 more source
A note on thickness of knots [PDF]
The Open Book Series, 2020 We introduce a numerical invariant \beta(K) of a knot K which measures how non-alternating K is. We prove an inequality between \beta (K) and the (knot Floer) thickness of K. As an application we show that all Montesinos knots have thickness at most one.
A. Stipsicz, Z. Szabó
semanticscholar +1 more source
Medicina, 2021 Background and Objectives: Porcine xenografts have been used successfully in partial thickness burn treatment for many years. Their disappearance from the market led to the search for effective and efficient alternatives.
H. Haller +11 more
semanticscholar +1 more source
Two-Page Book Embeddings of 4-Planar Graphs [PDF]
, 2014 Back in the Eighties, Heath showed that every 3-planar graph is subhamiltonian and asked whether this result can be extended to a class of graphs of degree greater than three.
Bekos, Michael A. +2 more
core +2 more sources
Graph classes and forbidden patterns on three vertices [PDF]
, 2020 This paper deals with graph classes characterization and recognition. A popular way to characterize a graph class is to list a minimal set of forbidden induced subgraphs.
Feuilloley, Laurent, Habib, Michel
core +1 more source