We consider the problem of finding a transitive orientation of a comparability graph, such that the edge set of its covering graph contains a given subset of edges. We propose a solution which… (More)

Article history: Received 26 April 2013 Received in revised form 12 November 2014 Accepted 14 November 2014 Available online 20 November 2014 Communicated by G. Ausiello

Given a positive integer k, the “{k}-packing function problem” ({k}PF) is to find in a given graph G, a function f that assigns a nonnegative integer to the vertices of G in such a way that the sum… (More)

Given a positive integer k, the {k}-packing function problem ({k}PF) is to find in a given graph G, a function f of maximum weight that assigns a non-negative integer to the vertices of G in such a… (More)

Edge-perfect graphs were introduced by Escalante et al (2009). An edge-subgraph of a given graph is an induced subgraph obtained by deletion of the endpoints of a subset of edges. A graph is… (More)