Results 1 to 10 of about 18,171 (249)
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
On the Upward Book Thickness Problem: Combinatorial and Complexity Results [PDF]
Lecture Notes in Computer Science, 2021 Appears in the Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)
Sujoy Bhore +2 more
exaly +4 more sources
Book Thickness of Planar Zero Divisor Graphs [PDF]
Missouri Journal of Mathematical Sciences, 2015 Let $R$ be a finite commutative ring with identity. We form the zero divisor graph of $R$ by taking the nonzero zero divisors as the vertices and connecting two vertices, $x$ and $y$, by an edge if and only if $xy=0$. We establish that if the zero divisor graph of a finite commutative ring with identity is planar, then the graph has a planar supergraph
McKenzie, Thomas, Overbay, Shannon
exaly +3 more sources
The Book Thickness of 1-Planar Graphs is Constant [PDF]
Algorithmica, 2016 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, Michael Kaufmann
exaly +4 more sources
Journal of Combinatorial Theory Series B, 1979 AbstractThe book thickness bt(G) of a graph G is defined, its basic properties are delineated, and relations are given with other invariants such as thickness, genus, and chromatic number. A graph G has book thickness bt(G) ≤ 2 if and only if it is a subgraph of a hamiltonian planar graph, but we conjecture that there are planar graphs with arbitrarily
Bernhart, Frank, Kainen, Paul C
exaly +3 more sources
Book thickness of the non-zero component union graph of the finite dimensional vector space
Indian Journal of Pure and Applied Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rilwan, N. Mohamed, Devi, S. Vasanthi
exaly +2 more sources
Graphs with Small Book Thickness
Missouri Journal of Mathematical Sciences, 2007 In an article published in 1979, Kainen and Bernhart [1] laid the groundwork for further study of book embeddings of graphs. They define an $n$-book as a line $L$ in 3-space, called the spine, and $n$ half-planes, called pages, with $L$ as their common boundary.
exaly +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