Results 51 to 60 of about 98 (93)
Embeddings of k-Connected Graphs of Pathwidth k
, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gupta, Arvind +3 more
openaire +1 more source
On the Pathwidth of Hyperbolic 3-Manifolds
, 2021 Computing in Geometry and Topology, Vol. 1 No. 1 (2022)
openaire +4 more sources
Majority constraints have bounded pathwidth duality
European Journal of Combinatorics, 2008 This work was partially supported by the UK EPSRC grant EP/C54384X/1. Part of this work was done when both authors visited the Isaac Newton Institute for Mathematical Sciences, Cambridge. The financial support provided by the Institute is gratefully acknowledged.
Dalmau, V., Krokhin, A.
openaire +3 more sources
Polynomial bounds for pathwidth
Dallard, Milanič, and Štorgel conjectured that for a hereditary graph class $\mathcal{G}$, if there is some function $f:\mathbb{N}\to\mathbb{N}$ such that every graph $G\in \mathcal{G}$ with clique number $ω(G)$ has treewidth at most $f(ω(G))$, then there is a polynomial function $f$ with the same property.
openaire +2 more sources
Tree-decompositions of small pathwidth
Electronic Notes in Discrete Mathematics, 2001 The treewidth \(\text{ tw}(G)\) of \(G\) can be defined as minimum width of a tree-decomposition of \(G\), or minimum \(\omega(H)-1\) of a chordal triangulation \(H\) of \(G\). Similarely, the pathwidth \(\text{ pw}(G)\) can be defined via path-decompositions or triangulations into interval graphs. Thereby a path-decomposition is a tree-decomposition \(
openaire +2 more sources
Protocol for aerosolization challenge of mice with Bordetella pertussis. [PDF]
STAR Protoc, 2023 Bitzer G +3 more
europepmc +1 more source
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Algorithmica, 2023 Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source
The Treewidth and Pathwidth of Graph Unions
SIAM Journal on Discrete MathematicsGiven two $n$-vertex graphs $G_1$ and $G_2$ of bounded treewidth, is there an $n$-vertex graph $G$ of bounded treewidth having subgraphs isomorphic to $G_1$ and $G_2$? Our main result is a negative answer to this question, in a strong sense: we show that the answer is no even if $G_1$ is a binary tree and $G_2$ is a ternary tree.
Bogdan Alecu +5 more
openaire +3 more sources
Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics. [PDF]
Algorithms Mol Biol, 2022 Marchand B, Ponty Y, Bulteau L.
europepmc +1 more source