Results 231 to 240 of about 17,820 (243)

On Fixed-Order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering

open access: closedTheoretical Computer Science, 2020
Given 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   +3 more
  +5 more sources

The book thickness of nilpotent graphs

open access: closedRocky Mountain Journal of Mathematics, 2022
Let \(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 ...
Kalaimurugan, G., Vignesh, P.
openaire   +3 more sources

Book thickness of toroidal zero-divisor graphs

open access: closedAfrika Matematika, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thomas McKenzie, Shannon Overbay
openaire   +2 more sources

1-Planar Graphs have Constant Book Thickness

open access: closed, 2015
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   +3 more
openaire   +2 more sources

On book thickness parameterized by the vertex cover number

open access: closedScience China Information Sciences, 2022
Yunlong Liu, Jie Chen, Jingui Huang
openaire   +2 more sources

Home - About - Disclaimer - Privacy