The ascending subgraph decomposition of Kn–H2n–1

The ascending subgraph decomposition of Kn–H2n–1

0.00 Avg rating0 Votes
Article ID: iaor19981826
Country: China
Volume: 10
Issue: 4
Start Page Number: 356
End Page Number: 360
Publication Date: Oct 1997
Journal: Journal of Systems Science and Complexity
Authors: ,
Abstract:

A conjecture concerning a new kind of subgraph decomposition, the ascending subgraph decomposition, was proposed by Alavi et al, as follows: Every graph of positive size has an ascending subgraph decomposition. In this paper it is proved that G = Kn–H2n–1 has an ascending subgraph decomposition, where H2n–1 is any graph with at most n vertices and at most 2n–1 edges (n≥6).

Reviews

Required fields are marked *. Your email address will not be published.