Geodesic
Every graph is an induced isopart of a circulant
Czechoslovak Mathematical Journal, Tome 36 (1986) no. 2, pp. 172-176
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1986.102080
Classification : 05C70 
@article{10_21136_CMJ_1986_102080,
     author = {Fink, John Frederick and Ruiz, Sergio},
     title = {Every graph is an induced isopart of a circulant},
     journal = {Czechoslovak Mathematical Journal},
     pages = {172--176},
     year = {1986},
     volume = {36},
     number = {2},
     doi = {10.21136/CMJ.1986.102080},
     mrnumber = {831304},
     zbl = {0614.05052},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1986.102080/}
}
TY  - JOUR
AU  - Fink, John Frederick
AU  - Ruiz, Sergio
TI  - Every graph is an induced isopart of a circulant
JO  - Czechoslovak Mathematical Journal
PY  - 1986
SP  - 172
EP  - 176
VL  - 36
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1986.102080/
DO  - 10.21136/CMJ.1986.102080
LA  - en
ID  - 10_21136_CMJ_1986_102080
ER  - 
%0 Journal Article
%A Fink, John Frederick
%A Ruiz, Sergio
%T Every graph is an induced isopart of a circulant
%J Czechoslovak Mathematical Journal
%D 1986
%P 172-176
%V 36
%N 2
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1986.102080/
%R 10.21136/CMJ.1986.102080
%G en
%F 10_21136_CMJ_1986_102080
Fink, John Frederick; Ruiz, Sergio. Every graph is an induced isopart of a circulant. Czechoslovak Mathematical Journal, Tome 36 (1986) no. 2, pp. 172-176. doi: 10.21136/CMJ.1986.102080

[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

[2] J. F. Fink: Every graph is an induced isopart of a connected regular graph. submitted.

[3] F. Harary R. W. Robinson, N. С. Wormald: Isomorphic factorizations V.: Directed graphs. Mathematika 25 (1978), 279-285. | DOI | MR

[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

[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

Cité par Sources :