Naturally submodular digraphs and forbidden digraph configurations

Naturally submodular digraphs and forbidden digraph configurations

0.00 Avg rating0 Votes
Article ID: iaor20013533
Country: Netherlands
Volume: 100
Issue: 1/2
Start Page Number: 67
End Page Number: 84
Publication Date: Mar 2000
Journal: Discrete Applied Mathematics
Authors: , ,
Keywords: game theory
Abstract:

In this paper, we present several characterizations of the classes of naturally submodular digraphs and naturally submodular bi-directed graphs. For each class, one characterization is given in terms of forbidden digraph configurations and the other in terms of graph decomposition. For the class of bi-directed graphs, an additional characterization in terms of the fixed-order property is also derived.

Reviews

Required fields are marked *. Your email address will not be published.