On k-Cycled Refinements of Certain Graphs
Canadian mathematical bulletin, Tome 26 (1983) no. 2, pp. 152-156

Voir la notice de l'article provenant de la source Cambridge

DOI

A graph is k -cycled if all its cycles are integral multiples of an integer k ≥ 2. We determine the structure of refinements of Kn and Kn, m which are k-cycled.
DOI : 10.4153/CMB-1983-025-1
Mots-clés : 05C38
Hartman, Jehuda; Katchalski, Meir. On k-Cycled Refinements of Certain Graphs. Canadian mathematical bulletin, Tome 26 (1983) no. 2, pp. 152-156. doi: 10.4153/CMB-1983-025-1
@article{10_4153_CMB_1983_025_1,
     author = {Hartman, Jehuda and Katchalski, Meir},
     title = {On {k-Cycled} {Refinements} of {Certain} {Graphs}},
     journal = {Canadian mathematical bulletin},
     pages = {152--156},
     year = {1983},
     volume = {26},
     number = {2},
     doi = {10.4153/CMB-1983-025-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1983-025-1/}
}
TY  - JOUR
AU  - Hartman, Jehuda
AU  - Katchalski, Meir
TI  - On k-Cycled Refinements of Certain Graphs
JO  - Canadian mathematical bulletin
PY  - 1983
SP  - 152
EP  - 156
VL  - 26
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1983-025-1/
DO  - 10.4153/CMB-1983-025-1
ID  - 10_4153_CMB_1983_025_1
ER  - 
%0 Journal Article
%A Hartman, Jehuda
%A Katchalski, Meir
%T On k-Cycled Refinements of Certain Graphs
%J Canadian mathematical bulletin
%D 1983
%P 152-156
%V 26
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1983-025-1/
%R 10.4153/CMB-1983-025-1
%F 10_4153_CMB_1983_025_1

Cité par Sources :