Delta-system decompositions of graphs
AbstractWe show that for any positive integer c the problem whether the edge-set of a graph can be partitioned into subsets inducing graphs isomorphic to either a c-edge star or a c-edge matching is polynomial. This result suggests existence of theorems well-characterizing graphs admitting such partitions.
|Journal series||Discrete Mathematics, ISSN 0012-365X|
|Publication indicators||= 3; = 3; : 1999 = 0.846; : 2006 = 0.347 (2) - 2007=0.501 (5)|
|Citation count*||4 (2015-02-23)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.