Results 231 to 240 of about 3,543,110 (254)
Some of the next articles are maybe not open access.
The book thickness of nilpotent graphs
Rocky Mountain Journal of Mathematics, 2022In this paper, we find the exact book thickness of all nilpote nt graphs associated to commutative rings with non-zero identity whose genus is at most on e.
G. Kalaimurugan, P. Vignesh
semanticscholar +1 more source
Investigation of Choroidal Blood Flow and Thickness Changes Induced by Near Work in Young Adults
Current Eye Research, 2023Purpose This research aimed to determine the effects of near work on macular choroidal blood flow and thickness in young adults. Methods A total of 109 participants (19–28 years old) were recruited from Capital Medical University in China.
Xintong Liang +8 more
semanticscholar +1 more source
The Book Thickness of 1-Planar Graphs is Constant
Algorithmica, 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.
M. Bekos +3 more
semanticscholar +2 more sources
The Technique of “Book Beating” in Traditional Chinese Book Conservation
Restaurator. International journal for the preservation of library and archival material, 2023Historic books are important vehicles for understanding the evolution of human civilisation. To preserve these precious historical materials, unremitting research and exploration has been carried out for thousands of years.
Zhewei Shen, Rong Yu, Peng Liu
semanticscholar +1 more source
Star arboricity relaxed book thickness of Kn
arXiv.orgA 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
P. C. Kainen
semanticscholar +1 more source
On book thickness parameterized by the vertex cover number
Science China Information Sciences, 2022Yunlong Liu, Jie Chen, Jingui Huang
semanticscholar +1 more source
A Note on Matching Book Embedding of the Cartesian Product of a Uni-chord Cycle and a Cycle
Journal of Interconnection Networks (JOIN)A [Formula: see text] [Formula: see text] of a graph is a placement of its vertices to a spine and an embedding of edges into pages so that edges in the same page do not cross each other.
Yifei Yuan +3 more
semanticscholar +1 more source