Results 41 to 50 of about 18,171 (249)
Graph Treewidth and Geometric Thickness Parameters
Consider a drawing of a graph $G$ in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of $G$, is the classical graph parameter "thickness".
C.S..J.A. Nash-Williams +13 more
core +4 more sources
Design issues in the production of hyper‐books and visual‐books [PDF]
This paper describes an ongoing research project in the area of electronic books. After a brief overview of the state of the art in this field, two new forms of electronic book are presented: hyper‐books and visual‐books.
Catenazzi, Nadia +2 more
core +3 more sources
AASLD practice guidance on drug, herbal, and dietary supplement–induced liver injury
Hepatology, EarlyView.
Robert J. Fontana +6 more
wiley +1 more source
Mixed Linear Layouts of Planar Graphs
A $k$-stack (respectively, $k$-queue) layout of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing (non-nested) edges with respect to the vertex ordering. In 1992, Heath and Rosenberg conjectured
C Bachmaier +12 more
core +1 more source
Two pyridinium‐based ionic liquid templated hybrid manganese halides, (C4Py)2[MnCl4] and (C4Py)2[MnBr4], display similar bulk structures but show significantly different photoluminescence behaviors due to the bromine heavy‐atom effect. Their stable local Mn environments remain intact even in the molten state, allowing applications such as luminescence ...
Biswajit Bhattacharyya +22 more
wiley +1 more source
By integrating single‐nuclei and spatial transcriptomics, this study presents a stereoscopic landscape of maize leaf to Puccinia polysora infection. Epidermal and mesophyll cells initiate primary defenses via RLPs/RLKs and jasmonic acid signaling. Cell‐cell communication analyses further reveal the underlying the dynamics of the underlying immune ...
Qiongqiong Wang +16 more
wiley +1 more source
Layout of Graphs with Bounded Tree-Width
A \emph{queue layout} of a graph consists of a total order of the vertices, and a partition of the edges into \emph{queues}, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its \emph{queue-
Albertson Michael +10 more
core +2 more sources
On Optimal 2- and 3-Planar Graphs [PDF]
A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized, this has not ...
Bekos, Michael A. +2 more
core +2 more sources
Corals and Reef‐Dwelling Fish Regulate Carbon Storage and Cycling Processes in Coral Reef Ecosystems
Coral reefs are biodiversity hotspots, yet their role in carbon storage and cycling remains poorly understood. Using field surveys and modeling in the South China Sea, we reveal the overlooked potential of carbon storage in reef ecosystems and how reef fish, corals, and surface sediment jointly shape reef carbon reservoirs.
Yiting Chen +8 more
wiley +1 more source
To Prove Four Color Theorem [PDF]
In this paper, we give a proof for four color theorem(four color conjecture). Our proof does not involve computer assistance and the most important is that it can be generalized to prove Hadwiger Conjecture. Moreover, we give algorithms to color and test
Cao, Weiwei, Yue, Weiya
core

