Results 11 to 20 of about 3,875,937 (262)
The Book Thickness of 1-Planar Graphs is Constant [PDF]
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
semanticscholar +5 more sources
Book thickness of the non-zero component union graph of the finite dimensional vector space
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rilwan, N. Mohamed, Devi, S. Vasanthi
openaire +2 more sources
Book Thickness of Planar Zero Divisor Graphs [PDF]
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
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
Bernhart, Frank, Kainen, Paul C
openaire +3 more sources
Genus and book thickness of reduced cozero-divisor graphs of commutative rings
Summary: For a commutative ring \(R\) with identity, let \(\langle a\rangle\) be the principal ideal generated by \(a\in R\). Let \(\Omega (R)^*\) be the set of all nonzero proper principal ideals of \(R\). The reduced cozero-divisor graph \(\Gamma_r (R)\) of \(R\) is the simple undirected graph whose vertex set is \(\Omega (R)^*\) and such that two ...
Jesili, Edward +2 more
openaire +2 more sources
Graphs with Small Book Thickness
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
openaire +3 more sources
Characterization of Korean handmade papers collected in a Hanji reference book
Korean hand papermaking is a renowned cultural tradition in the Korean peninsula. It is still practiced while scientific analysis of paper itself from a large data set is rare.
Bin Han +5 more
doaj +2 more sources
Star arboricity relaxed book thickness of $K_n$
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.
P. C. Kainen
openaire +3 more sources
DESIGNING THE TRAFFIC PHASES USING GRAPH COLOURING AND BOOK THICKNESS TO REDUCE THE TRAFFIC FOR A SELECTED JUNCTION IN COLOMBO CITY. [PDF]
B.M.Y.U.A. Batugedara, G.H.J. Lanel.
openaire +2 more sources
Abstrak Folktale adalah kejadian yang diceritakan secara turun temurun antar generasi atau karya-karya tradisional, yang dikenal, dan dimiliki setiap orang atau masyarakat. Folktale dipenuhi dengan kisah kearifan lokal, wisdom, cinta kasih, atau sebuah
Shienny Megawati Sutanto +1 more
doaj +1 more source

