11 citations · 18 across the 16 of their papers we have counts for
5 papers · 1 filter
On minimally tough chordal graphs
Clément Dallard, Blas Fernández, Gyula Y. Katona +2
Katona and Varga showed that for any rational number , no chordal graph is minimally -tough, while Katona and Khan characterized all minimally -tough, chordal…
Computing Tree Decompositions with Small Independence Number
Clément Dallard, Fedor V. Fomin, Petr A. Golovach +2
The independence number of a tree decomposition is the maximum of the independence numbers of the subgraphs induced by its bags. The tree-independence number of a graph is the mini…
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,…
Finding -community structures in special graph classes
Narmina Baghirova, Clément Dallard, Bernard Ries +1
For a fixed integer , a -community structure in an undirected graph is a partition of its vertex set into sets called communities, each of size at least two, such th…
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…