3 research outputs found
All <em>P<sub>3</sub></em>-equipackable graphs
AbstractA graph G is P3-equipackable if any sequence of successive removals of edge-disjoint copies of P3 from G always terminates with a graph having at most one edge. All P3-equipackable graphs are characterised. They belong to a small number of families listed here