| On the Problem of Ascending SubgraphDecompositions into Matchings |
| Received:December 12, 1991 |
| Key Words:
|
| Fund Project: |
|
| Hits: 1936 |
| Download times: 1166 |
| Abstract: |
| Alavi has given the definition of the ascending subgraph decomposition. Heconjectured that every graph of positive size has an asceuding subgraph decomposition.In this paper it is proved that a graph G of size (?)has an ascending subgraphdecomposition {Gi}, 1≤i≤n, with Gi≈iK2 if the edge chromatic number x＇(G)≤(n + 2)/2. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.1994.01.009 |
| View Full Text View/Add Comment |
