Results 1 to 10 of about 12,787,233 (297)
On Page Number of N-free Posets
Electronic Notes in Discrete Mathematics, 2006 Abstract In this paper we deal with the page number of partially ordered sets (posets). In particular, we find the page number of some N -free posets whose root graphs form a family of planar posets with known page number.
Anna Beata Kwiatkowska, Maciej M. Syslo
exaly +3 more sources
The mixed page number of graphs
Theoretical Computer Science, 2022 A linear layout of a graph typically consists of a total vertex order, and a partition of the edges into sets of either non-crossing edges, called stacks, or non-nested edges, called queues. The stack (queue) number of a graph is the minimum number of required stacks (queues) in a linear layout.
Jawaherul Md. Alam +4 more
openaire +3 more sources
On the page-number of a circulant graph
AKCE International Journal of Graphs and CombinatoricsThe page-number of a graph G, denoted by p(G), is the minimum k such that G has an embedding in a k-book. The circulant graph C(m, n) is such a graph that its vertex set is [Formula: see text] and edge set is [Formula: see text], where m, n are positive ...
Xiaoyuan Dong, Dengju Ma
doaj +2 more sources
Discrete Mathematics & Theoretical Computer Science, 2004 A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović +2 more
doaj +1 more source
Two Results on Layered Pathwidth and Linear Layouts
Journal of Graph Algorithms and Applications, 2021 Layered pathwidth is a new graph parameter studied by Bannister et al. (2015). In this paper we present two new results relating layered pathwidth to two types of linear layouts. Our first result shows that, for any graph $G$, the stack number of $G$ is
Vida Dujmović, Pat Morin, Céline Yelle
doaj +1 more source
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A \emphk-stack layout (respectively, \emphk-queuelayout) 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.
Vida Dujmović, David R. Wood
doaj +1 more source
On Linear Layouts of Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 In a total order of the vertices of a graph, two edges with no endpoint in common can be \emphcrossing, \emphnested, or \emphdisjoint. A \emphk-stack (respectively, \emphk-queue, \emphk-arch) \emphlayout of a graph consists of a total order of the ...
Vida Dujmović, David R. Wood
doaj +1 more source
MethodsX, 2022 Two-dimensional polyacrylamide gel electrophoresis (2D-PAGE) is widely used in proteomics studies. Hundreds of proteins extracted from a biological sample can be separated and visualized on a 2D-PAGE gel.
Alka Tiwari +2 more
doaj +1 more source
Analysis of visits to ScienceCentral, an open access full-text archive of scientific society journal literature [PDF]
Science Editing, 2017 ScienceCentral is a free or open access full-text archive of scientific society journal literature hosted by the Korean Federation of Science and Technology Societies. It was launched in December 2013.
Younsang Cho, Sun Huh
doaj +1 more source
Erratum Jurnal Psikologi Volume 49, Number 2 in August 2022
Jurnal Psikologi, 2022 This erratum is to explain a pagination error occurred in the published issue of Jurnal Psikologi Volume 25, Number 1 (1998). The error above was due to problem in scanning the printed version of the article that caused one needless page slipped between ...
Erratum Jurnal Psikologi
doaj +1 more source