Results 1 to 10 of about 18,019 (79)
On the Upward Book Thickness Problem: Combinatorial and Complexity Results [PDF]
Lecture Notes in Computer Science, 2021 Appears in the Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)
Sujoy Bhore +2 more
exaly +4 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 ...
Michael A Bekos +2 more
exaly +4 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
Thomas Mckenzie, Shannon Overbay
exaly +3 more sources
Journal of Combinatorial Theory Series B, 1979 AbstractThe book thickness bt(G) of a graph G is defined, its basic properties are delineated, and relations are given with other invariants such as thickness, genus, and chromatic number. A graph G has book thickness bt(G) ≤ 2 if and only if it is a subgraph of a hamiltonian planar graph, but we conjecture that there are planar graphs with arbitrarily
Paul C Kainen
exaly +3 more sources
Graphs with Small Book Thickness
Missouri Journal of Mathematical Sciences, 2007 In an article published in 1979, Kainen and Bernhart [1] laid the groundwork for further study of book embeddings of graphs. They define an $n$-book as a line $L$ in 3-space, called the spine, and $n$ half-planes, called pages, with $L$ as their common boundary.
Shannon Overbay
exaly +3 more sources
Book thickness of the non-zero component union graph of the finite dimensional vector space
Indian Journal of Pure and Applied Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
N Mohamed Rilwan
exaly +2 more sources
DESIGNING THE TRAFFIC PHASES USING GRAPH COLOURING AND BOOK THICKNESS TO REDUCE THE TRAFFIC FOR A SELECTED JUNCTION IN COLOMBO CITY. [PDF]
International Journal of Advanced Research, 2017 B.M.Y.U.A. Batugedara, G.H.J. Lanel.
exaly +2 more sources
On the Book Thickness of k-Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Graphs and Algorithms 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 thickness at most k.
Vida Dujmović, David R. Wood
openaire +4 more sources
Matching book thickness of generalized Petersen graphs
Electronic Journal of Graph Theory and Applications, 2022 Summary: 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
openaire +3 more sources
On the Book Thickness of 1-Planar Graphs
CoRR, 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
Md. Jawaherul Alam +2 more
openaire +2 more sources