Results 1 to 10 of about 18,023 (143)
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 +7 more sources
On the Book Thickness of k-Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Graphs and ...
Vida Dujmović, David R. Wood
doaj +4 more sources
Matching book thickness of generalized Petersen graphs
Electronic Journal of Graph Theory and Applications, 2022 The matching book embedding of a graph G is to place its vertices on the spine, and arrange its edges on the pages so that the edges in the same page do not intersect each other and the edges induced subgraphs of each page are 1-regular.
Zeling Shao, Huiru Geng, Zhiguo Li
doaj +3 more sources
Matching Book Thickness of Halin Graphs
, 2020 The proof in the manuscripts can be ...
Shao, Zeling, Geng, Huiru, Li, Zhiguo
openaire +3 more sources
Winter Arctic sea ice thickness from ICESat-2: upgrades to freeboard and snow loading estimates and an assessment of the first three winters of data collection [PDF]
The Cryosphere, 2023 NASA's ICESat-2 mission has provided near-continuous, high-resolution estimates of sea ice freeboard across both hemispheres since data collection started in October 2018.
A. A. Petty +7 more
doaj +1 more source
Pathomorphological changes in the early postnatal period in a calf with abomasum rupture [PDF]
BIO Web of Conferences, 2022 The main cause of the disease and death of calves in the early postembryonic period of development is a feeding disorder. The aim of the work was to analyze macro-and micromorphological changes in the digestive system of a calf with a rennet rupture.
Mannova Maria Sergeevna +2 more
doaj +1 more source
On the Upward Book Thickness Problem: Combinatorial and Complexity Results [PDF]
European Journal of Combinatorics, 2021 Appears in the Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)
Sujoy Bhore +3 more
openaire +3 more sources
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
Український антарктичний журнал, 2023 Review of ‘Contributions to understanding climate interactions: stratospheric ozone’ by Gennadi Milinevsky, Asen Grytsai, Oleksandr Evtushevsky, and Andrew Klekociuk. (2022). Kyiv, Akademperiodyka, 252 pp. ISBN: 978-966-360-471-8.
S. Krakovska
doaj +1 more source