Results 1 to 10 of about 17,721 (144)
On the Book Thickness of k-Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Graphs and ...
Vida Dujmović, David R. Wood
doaj +7 more sources
Matching book thickness of generalized Petersen graphs [PDF]
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
doaj +4 more sources
Matching Book Thickness of Halin Graphs [PDF]
, 2020 The proof in the manuscripts can be ...
Shao, Zeling, Geng, Huiru, Li, Zhiguo
core +4 more sources
On the Upward Book Thickness Problem: Combinatorial and Complexity Results [PDF]
European Journal of Combinatorics, 2021 Appears in the Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)
Sujoy Bhore +3 more
+8 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 cross.
Vida Dujmović +2 more
doaj +7 more sources
The Book Thickness of 1-Planar Graphs is Constant [PDF]
Algorithmica, 2016 In 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 ...
Bekos, Michael A. +3 more
openaire +5 more sources
Separating Geometric Thickness from Book Thickness [PDF]
, 2001 3 pages, 1 ...
David Eppstein
openaire +3 more sources
On the Book Thickness of 1-Planar Graphs [PDF]
, 2015 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
Alam, Md. Jawaherul +2 more
openaire +3 more sources
Star arboricity relaxed book thickness of $K_n$ [PDF]
A book embedding of the complete graph $K_n$ needs $\lceil \frac{n}{2} \rceil$ pages and the page-subgraphs can be chosen to be spanning paths (for $n$ even) and one spanning star for $n$ odd. We show that all page-subgraphs can be chosen to be {\rm star forests} by including one extra {\rm cross-cap} page or two new ordinary pages.
Paul C. Kainen
openaire +3 more sources
Book Thickness of Planar Zero Divisor Graphs [PDF]
Missouri Journal of Mathematical Sciences, 2015 Let $R$ be a finite commutative ring with identity. We form the zero divisor graph of $R$ by taking the nonzero zero divisors as the vertices and connecting two vertices, $x$ and $y$, by an edge if and only if $xy=0$. We establish that if the zero divisor graph of a finite commutative ring with identity is planar, then the graph has a planar supergraph
McKenzie, Thomas, Overbay, Shannon
openaire +3 more sources