4 papers · 1 filter
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…
Induced matching treewidth and tree-independence number, revisited
Noga Alon, Martin MilaniÄ, PaweÅ RzÄ Å¼ewski
We study two graph parameters defined via tree decompositions: tree-independence number and induced matching treewidth. Both parameters are defined similarly as treewidth, but with…
Sandwich Monotonicity and Recognition of Weighted Graph Classes
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler +9
Edge-weighted graphs play an important role in the theory of Robinsonian matrices and similarity theory, particularly via the concept of level graphs, that is, graphs obtained from…
Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases
Narmina Baghirova, Esther Galby, Martin MilaniÄ
In this paper, we present new efficiently solvable cases of the Minimum Uncovering Branching problem, an optimization problem with applications in cancer genomics introduced by Huj…