Results 71 to 80 of about 1,532 (205)
Kernelization for Treewidth-2 Vertex Deletion [PDF]
, 2022 Jeroen L. G. Schols
openalex +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
Journal of Graph Theory, Volume 106, Issue 4, Page 816-842, August 2024.Abstract A minimal separator of a graph G is a set S ⊆ V ( G ) such that there exist vertices a , b ∈ V ( G ) ⧹ S with the property that S separates a from b in G, but no proper subset of S does. For an integer k ≥ 0, we say that a minimal separator is k‐simplicial if it can be covered by k cliques and denote by G k the class of all graphs in which ...
Martin Milanič +3 more
wiley +1 more source
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023 80 pages, 2 ...
Korhonen, Tuukka +4 more
openaire +2 more sources
On the parameterized complexity of computing tree-partitions [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree.
Hans L. Bodlaender +2 more
doaj +1 more source
Tree independence number I. (Even hole, diamond, pyramid)‐free graphs
Journal of Graph Theory, Volume 106, Issue 4, Page 923-943, August 2024.Abstract The tree‐independence number tree‐ α, first defined and studied by Dallard, Milanič, and Štorgel, is a variant of treewidth tailored to solving the maximum independent set problem. Over a series of papers, Abrishami et al. developed the so‐called central bag method to study induced obstructions to bounded treewidth.
Tara Abrishami +5 more
wiley +1 more source
International Journal of Foundations of Computer Science, 1993 In this paper we show that the treewidth of a circle graph can be computed in polynomial time. A circle graph is a graph that is isomorphic to the intersection graph of a finite collection of chords of a circle. The TREEWIDTH problem can be viewed upon as the problem of finding a chordal embedding of the graph that minimizes the clique number.
openaire +5 more sources
On Interval Routing Schemes and treewidth [PDF]
Information and Computation, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bodlaender, H.L. +3 more
openaire +3 more sources
Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal [PDF]
, 2021 Karl Bringmann, Jasper Slusallek
openalex +1 more source