Results 111 to 120 of about 11,505 (254)
On the treewidth of toroidal grids
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Masashi Kiyomi +2 more
openaire +2 more sources
Diameter and Treewidth in Minor-Closed Graph Families
, 1999 It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families.
Eppstein, David
core +2 more sources
Super stable tensegrities and the Colin de Verdière number ν
Journal of Graph Theory, Volume 108, Issue 3, Page 401-431, March 2025.Abstract A super stable tensegrity introduced by Connelly in 1982 is a globally rigid discrete structure made from stiff bars and struts connected by cables with tension. We introduce the super stability number of a multigraph as the maximum dimension that a multigraph can be realized as a super stable tensegrity, and show that it equals the Colin de ...
Ryoshun Oba, Shin‐ichi Tanigawa
wiley +1 more source
Size‐Ramsey numbers of graphs with maximum degree three
Journal of the London Mathematical Society, Volume 111, Issue 3, March 2025.Abstract The size‐Ramsey number r̂(H)$\hat{r}(H)$ of a graph H$H$ is the smallest number of edges a (host) graph G$G$ can have, such that for any red/blue colouring of G$G$, there is a monochromatic copy of H$H$ in G$G$. Recently, Conlon, Nenadov and Trujić showed that if H$H$ is a graph on n$n$ vertices and maximum degree three, then r̂(H)=O(n8/5 ...
Nemanja Draganić, Kalina Petrova
wiley +1 more source
An Efficient Algorithm for Computing Network Reliability in Small Treewidth
, 2019 We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges.
Goharshady, Amir Kafshdar +1 more
core +1 more source
Subcubic graphs of large treewidth do not have the edge-Erdős-Pósa property [PDF]
, 2023 Raphael Steck, Henning Bruhn
openalex +1 more source
Parameterized Compilation Lower Bounds for Restricted CNF-formulas
, 2016 We show unconditional parameterized lower bounds in the area of knowledge compilation, more specifically on the size of circuits in decomposable negation normal form (DNNF) that encode CNF-formulas restricted by several graph width measures.
A Darwiche +12 more
core +1 more source
Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries [PDF]
Logical Methods in Computer ScienceWe show that the problem of whether a query is equivalent to a query of tree-width $k$ is decidable, for the class of Unions of Conjunctive Regular Path Queries with two-way navigation (UC2RPQs).
Diego Figueira, Rémi Morvan
doaj +1 more source
Hyperbolic intersection graphs and (quasi)-polynomial time
, 2019 We study unit ball graphs (and, more generally, so-called noisy uniform ball graphs) in $d$-dimensional hyperbolic space, which we denote by $\mathbb{H}^d$.
Kisfaludi-Bak, Sándor
core +1 more source
Contraction obstructions for treewidth
Journal of Combinatorial Theory, Series B, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fedor V. Fomin +2 more
openaire +3 more sources