Results 141 to 150 of about 5,860 (222)

Every Graph is Essential to Large Treewidth [PDF]

arXiv
We show that for every graph $H$, there is a hereditary weakly sparse graph class $\mathcal C_H$ of unbounded treewidth such that the $H$-free (i.e., excluding $H$ as an induced subgraph) graphs of $\mathcal C_H$ have bounded treewidth. This refutes several conjectures and critically thwarts the quest for the unavoidable induced subgraphs in classes of
arxiv  

Infrared: a declarative tree decomposition-powered framework for bioinformatics

, 2023
Yao H, Marchand B, Berkemer SJ, Ponty Y, Will S.   +4 more
europepmc   +1 more source

Girth and treewidth

, 2005
L. Sunil Chandran, C. R. Subramanian
openalex   +1 more source

Reoptimization of parameterized problems. [PDF]

Acta Inform, 2022
Böckenhauer HJ, Burjons E, Raszyk M, Rossmanith P.   +3 more
europepmc   +1 more source

Boxicity and Treewidth

, 2005
L. Sunil Chandran, Naveen Sivadasan
openalex   +2 more sources

The complexity of frugal colouring. [PDF]

Arab J Math, 2021
Bard S, MacGillivray G, Redlin S.
europepmc   +1 more source

Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth [PDF]

, 2010
Markus Bläser, Christian Herzog
openalex   +1 more source

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts

, 2023
Anagnostides I, Lenzen C, Haeupler B, Zuzic G, Gouleakis T.   +4 more
europepmc   +1 more source

Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth [PDF]

, 2011
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx   +2 more
openalex   +1 more source

Romeo and Juliet Meeting in Forest Like Regions

, 2023
Misra N, Mulpuri M, Tale P, Viramgami G.
europepmc   +1 more source