Published May 29, 2010
| Version v1
Journal article
Open
The (a, d)-Ascending Subgraph Decomposition
Authors/Creators
Description
By a graph we mean a finite undirected graph without loops or multiple edges. A wheel on p vertices is denoted by Wp.