From the 1 of 5 linked papers with an AI index.
5 papers
Edge-decomposition into Two Triangular Forests is NP-complete
Beniamin Bibrowski, Tomáš MasaÅÃk
The paper proves that deciding whether a given graph can be edge‑decomposed into two triangular forests is NP‑complete.
Induced ErdÅs--Pósa property for long holes, long thetas, and beyond
Jadwiga Czyżewska, Tomáš MasaÅÃk, Marcin Pilipczuk +2
The induced ErdÅs--Pósa property in graphs relates the maximum number of pairwise anti-adjacent copies of an object with the minimum number of neighborhoods required to hit all c…
General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
Gaspard Charvy, Tomáš MasaÅÃk
We investigate a very recent concept for visualizing various aspects of a graph in the plane using a collection of drawings introduced by HlinÄný and MasaÅÃk [GD 2023]. Formall…
Tree-independence number of -free graphs with no large bicliques
Václav Blažej, J. Pascal Gollin, Tomáš Hons +5
The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bo…
Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
Ãdouard Bonnet, JÄdrzej Hodor, Tuukka Korhonen +1
A graph contains a graph as an induced minor if can be obtained from after vertex deletions and edge contractions. We show that for every -vertex planar graph $H…