Results 211 to 220 of about 7,885,231 (225)
Some of the next articles are maybe not open access.
The book thickness of nilpotent graphs
Rocky Mountain Journal of Mathematics, 2022Let \(R\) be a commutative ring with nonzero identity and let \(Z_N(R)=\{y \in R: yz ~\text{is}~ \text{nilpotent for some}~z\in R^*=R \setminus \{0\} \}.\) The nilpotent graph \(\Gamma_N (R)\) of \(R\) is the graph whose vertex set coincide with \(Z_N(R)^{*}=Z_N(R)\setminus \{0\}\) and there is an edge between two distinct vertices \(x\) and \(y\) if ...
G Kalaimurugan
exaly +3 more sources
On Fixed-Order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering
Lecture Notes in Computer Science, 2020Given a graph \(G=(V,E)\) and a fixed linear order \(\prec \) of V, the problem fixed-order book thickness asks whether there is a page assignment \(\sigma \) such that \(\langle \prec ,\sigma \rangle \) is a k-page book embedding of G. Recently, Bhore et al.(GD2019) presented an algorithm parameterized by the pathwidth of the vertex ordering (denoted ...
Yunlong Liu +2 more
exaly +2 more sources
Book thickness of toroidal zero-divisor graphs
Afrika Matematika, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thomas Mckenzie, Shannon Overbay
exaly +2 more sources
1-Planar Graphs have Constant Book Thickness
Lecture Notes in Computer Science, 2015In 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 +2 more sources
On book thickness parameterized by the vertex cover number
Science China Information Sciences, 2022Yunlong Liu, Jingui Huang
exaly +2 more sources
Genus and Book Thickness of the Inclusion Ideal Graph of a Ring
Springer Proceedings in Mathematics and Statistics, 2021S Kavitha
exaly +2 more sources
ON THE BOOK THICKNESS OF TOTAL GRAPHS OF COMMUTATIVE RINGS
Missouri Journal of Mathematical SciencesMallory Delorfino +4 more
exaly +2 more sources
On the upward book thickness problem: Combinatorial and complexity results
European Journal of Combinatorics, 2023Sujoy Bhore +2 more
exaly
Library inventory using a RFID wand: contribution of tag and book specific factors on the read rate
Library Hi Tech, 2021Kasper Abcouwer, E Emiel Van Loon
exaly