The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
We study (vertex-disjoint) packings of paths of length two (i.e., of P2's) in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use e...
This paper attempts to provide a better understanding of the facial structure of polyhedra previously investigated separately. It introduces the notion of transitive packing and th...