1 citations · 2 across the 18 of their papers we have counts for
5 papers · 1 filter
W[1]-Hardness of Upper Clique Transversal
J. Pascal Gollin, Pascal J. Gollin, Tesshu Hanaka +3
A clique transversal of a graph is a set of vertices intersecting every maximal clique. We prove that deciding whether a graph has an inclusion-wise minimal clique transversal of s…
Excluding paths and bicliques
Maria Chudnovsky, Julien Codsi, Matjaž Krnc +1
Classes of graphs excluding a path and a biclique as induced subgraphs are extensively studied in the literature. One of the key structural results for such graphs is a Ramsey-type…
Clique-width and induced topological minors
Paweł Rafał Bieliński, Jadwiga Czyżewska, Martin Milanič +2
A is a chordless path on four vertices. A diamond is a graph obtained from a clique of size four by removing one edge of the clique. A paw is a graph obtained from a clique o…
Minimal toughness in subclasses of weakly chordal graphs
J. Pascal Gollin, Martin Milanič, Laura Ogrin
The toughness of a graph is defined as the largest real number such that for any set such that is disconnected, has at least times more elem…
Tree decompositions whose trees are subgraphs: An application of Simon's factorization
Romain Bourneuf, Gwenaël Joret, Piotr Micek +2
We show that every connected graph has a tree decomposition indexed by a tree such that is a subgraph of and the width of the tree decomposition is bounded from abo…