Title of article
Regular packings of regular graphs Original Research Article
Author/Authors
A graph H is G-decomposable if it contains subgraphs G1، نويسنده , , …، نويسنده , , Gh، نويسنده , , photocatalytic activities of the as-obtained nanocomposites have been evaluated based on the H2 evolution from oxalic acid solution under simulated sunlight irradiation. Factors such as CuCr2O4 to TiO2 molar ratio in the composites، نويسنده , , isomorphic to G whose sets of edges partition E(H). Wilson (Proceedings of the Fifth British Combinatorial Conference، نويسنده , , University of Aberdeen، نويسنده , , Aberdeen، نويسنده , , 1975، نويسنده , , pp. 647–659; Congr. Numer. XV، نويسنده , , Utilitas، نويسنده , , Math.، نويسنده , , Winnipeg، نويسنده , , Manitoba، نويسنده , , 1976) proved that، نويسنده , , given a nonempty graph G، نويسنده , , the complete graph KN is G-decomposable for N large enough، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
12
From page
83
To page
94
Abstract
A. Gutiérrez, A.S. Lladó
Keywords
Packing , Graph decomposition
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
949916
Link To Document