66 citations · 323 across the 55 of their papers we have counts for
5 papers · 1 filter
Computing Well-Covered Vector Spaces of Graphs using Modular Decomposition
Martin Milanič, Nevena Pivač
A graph is well-covered if all its maximal independent sets have the same cardinality. This well studied concept was introduced by Plummer in 1970 and naturally generalizes to the…
Tree decompositions with bounded independence number: beyond independent sets
Martin Milanič, Paweł Rzążewski
We continue the study of graph classes in which the treewidth can only be large due to the presence of a large clique, and, more specifically, of graph classes with bounded tree-in…
Avoidability beyond paths
Vladimir Gurvich, Matjaž Krnc, Martin Milanič +1
The concept of avoidable paths in graphs was introduced by Beisegel, Chudnovsky, Gurvich, Milanič, and Servatius in 2019 as a common generalization of avoidable vertices and simpli…
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
Clément Dallard, Martin Milanič, Kenny Štorgel
We continue the study of -bounded graph classes, that is, hereditary graph classes in which the treewidth can only be large due to the presence of a large clique,…
Allocation of Indivisible Items with Individual Preference Graphs
Nina Chiarelli, Clément Dallard, Andreas Darmann +5
This paper studies the allocation of indivisible items to agents, when each agent's preferences are expressed by means of a directed acyclic graph. The vertices of each preference…