Delta-system decompositions of graphs

Zbigniew Lonc

Abstract

We 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.
Author Zbigniew Lonc (FMIS / DAC)
Zbigniew Lonc,,
- Department of Algebra and Combinatorics
Journal seriesDiscrete Mathematics, ISSN 0012-365X
Issue year1997
Vol164
No1–3
Pages221-224
ASJC Classification2607 Discrete Mathematics and Combinatorics; 2614 Theoretical Computer Science
DOIDOI:10.1016/S0012-365X(96)00054-4
URL http://www.sciencedirect.com/science/article/pii/S0012365X96000544
Score (nominal)20
Score sourcejournalList
Publication indicators Scopus Citations = 3; WoS Citations = 3; Scopus SNIP (Source Normalised Impact per Paper): 1999 = 0.846; WoS Impact Factor: 2006 = 0.347 (2) - 2007=0.501 (5)
Citation count*4 (2015-02-23)
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back
Confirmation
Are you sure?