Results 1 to 10 of about 254,223 (195)
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
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
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages [PDF]
arXiv, 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. The book thickness of a graph is the minimum number of pages over all its book embeddings.
Bekos, Michael A. +5 more
arxiv +4 more sources
, 2008 Given an embedded planar acyclic digraph G, we define the problem of "acyclic hamiltonian path completion with crossing minimization (Acyclic-HPCCM)" to be the problem of determining an hamiltonian path completion set of edges such that, when these edges
Tamara Mchedlidze, Antonios Symvonis
openalex +4 more sources
Advancements on SEFE and Partitioned Book Embedding Problems [PDF]
, 2013 In this work we investigate the complexity of some problems related to the {\em Simultaneous Embedding with Fixed Edges} (SEFE) of $k$ planar graphs and the PARTITIONED $k$-PAGE BOOK EMBEDDING (PBE-$k$) problems, which are known to be equivalent under ...
Patrizio Angelini +2 more
openalex +4 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
Four Pages Are Indeed Necessary for Planar Graphs [PDF]
arXiv, 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 number of pages over all its book embeddings.
Bekos, Michael A. +5 more
arxiv +4 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]
A 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.
Robert Ganian +4 more
openalex +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