We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an O(n9)-time algorithm for the same problem restricted to Berge graphs. Our algorithm is not constructive : it certifies that a graph has a balanced skew partition if it has one. It relies on...

We give a structural description of the class C of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition. Basic classes are cliques, bipartite graphs with...

The present article looks at the meaning of gift-giving when it is performed via free online recycling websites. Underpinned by research on the difficulties inherent to giving, our paper illustrates how these websites remove the difficulties inherent in giving to kith, kin or to charities.

This study investigates whether European firms reporting under domestic GAAPs exhibit major differences while examining the relationship between their economic (financial, operating and competitive) performance and their recognized intangible investment (RII). Using a five-European-country...