Previous |  Up |  Next

Article

Title: Every graph is an induced isopart of a circulant  (English)
Author: Fink, John Frederick
Author: Ruiz, Sergio
Language: English
Journal: Czechoslovak Mathematical Journal
ISSN: 0011-4642
Volume: 36
Issue: 2
Year: 1986
Pages: 172-176
Summary lang: Russian
.
Category: math
.
Summary:
MSC: 05C70
idZBL: Zbl 0614.05052
idMR: MR831304
.
Date available: 2008-06-09T15:09:43Z
Last updated: 2012-05-30
Stable URL: http://hdl.handle.net/10338.dmlcz/102080
.
Reference: [1] J. С. Bermond, D. Sotteau: Graph decompositions and G-designs.Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, 1975). Congressus Numeratium, No. XV, Utilitas Math., Winnipeg, Man., (1976), 53-72. MR 0450102
Reference: [2] J. F. Fink: Every graph is an induced isopart of a connected regular graph.submitted.
Reference: [3] F. Harary R. W. Robinson, N. С. Wormald: Isomorphic factorizations V.: Directed graphs.Mathematika 25 (1978), 279-285. MR 0533135
Reference: [4] A. Rosa: On certain valuations of the vertices of a graph. Theory of Graphs.Proc. Internat. Sympos. Rome 1966, Gordon and Breach, New York, (1967), 349-355. MR 0223271
Reference: [5] R. M. Wilson: Decomposition of complete graphs into subgraphs isomorphic to a given graph.Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, 1975). Congressus Numeratium No XV, Utilitas Math., Winnipeg, Man. (1976), 647-659. MR 0396347
.

Files

Files Size Format View
CzechMathJ_36-1986-2_2.pdf 475.1Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo