Results 1 to 10 of about 95,786 (283)
Matching Book Embedding of the Cartesian Product of a Complete Graph and a Cycle [PDF]
Ars Combinatoria,2020(153),pp.89-97, 2020 The $book$ $embedding$ of a graph $G$ is to place the vertices of $G$ on the spine and draw the edges to the pages so that the edges in the same page do not cross with each other. The book embedding is $matching$ if the pages have maximum degree $1$. The $matching$ $book$ $thickness$ is the minimum number of pages in which graphs can be matching book ...
Zeling Shao, Yanqing Liu, Zhiguo Li
arxiv +3 more sources
Book embeddings of graphs and a theorem of Whitney [PDF]
Extension of a theorem of Whitney, {\it Appl Math Lett.} 20 (2007)
835--837, 2021 It is shown that the number of pages required for a book embedding of a graph is the maximum of the numbers needed for any of the maximal nonseparable subgraphs and that a plane graph in which every triangle bounds a face has a two-page book embedding. The latter extends a theorem of H.
Paul C. Kainen, Shannon Overbay
arxiv +3 more sources
Oriented Book Embeddings [PDF]
arXiv, 2016 A graph $G$ has a $k$-page book embedding if $G$ can be embedded into a $k$-page book. The minimum $k$ such that $G$ has a $k$-page book embedding is the book thickness of $G$, denoted $bt(G)$. Most of the work on this subject has been done for unoriented graphs and oriented acyclic graphs (no directed cycles). In this work we discuss oriented graphs $\
Stacey McAdams, Jinko Kanno
arxiv +3 more sources
On open book embedding of contact manifolds in the standard contact sphere [PDF]
Canadian Math. Bulletin, 1-16 (2019), 2018 We prove some open book embedding results in the contact category. For example, we show that a large class of contact 3-manifolds admit contact open book embedding in the standard contact 5- sphere. We also prove that all the Ustilovsky (4m + 1)-spheres contact open book embed in the standard contact (4m + 3)-sphere.
Kuldeep Saha
arxiv +3 more sources
Implementing a Partitioned 2-page Book Embedding Testing Algorithm [PDF]
arXiv, 2012 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 the Partitioned 2-page Book Embedding problem egdes are partitioned into two sets E_1 and E_2, the pages are two, the edges of E_1 are assigned to page 1, and the edges of E_2 are ...
Patrizio Angelini +2 more
arxiv +3 more sources
IEEE AccessBook recommendations are crucial in digital library transformation, enhancing service sophistication and customization. They allow readers to access books tailored to their specific interests.
Yafeng Kong
doaj +2 more sources
Parameterized Algorithms for Book Embedding Problems [PDF]
arXiv, 2019 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-page book embedding both when the linear order of the vertices is fixed, called Fixed-Order Book Thickness, or ...
Sujoy Bhore +3 more
arxiv +3 more sources
Early Childhood Education Papers, 2020 One of the character problems in early childhood is the lack of ability to be responsible, communicate, and cooperate. These three main behaviors are characteristics of leadership behavior.
Sinthia Nurul Fitri, Edi Waluyo
doaj +3 more sources
A Tight Subexponential-time Algorithm for Two-Page Book Embedding [PDF]
arXivA book embedding of a graph is a drawing that maps vertices onto a line and edges to simple pairwise non-crossing curves drawn into pages, which are half-planes bounded by that line. Two-page book embeddings, i.e., book embeddings into 2 pages, are of special importance as they are both NP-hard to compute and have specific applications.
Robert Ganian +4 more
arxiv +3 more sources
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
doaj +1 more source