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 University Press
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.
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 -
[1] 1. Harary, F., Graph Theory, Addison-Wesley, Reading, Mass., 1969. Google Scholar
[2] 2. Hartman, J., The homeomorphic embedding of K in the m-cube, Discrete Mathematics 16 (1976), 157–160. Google Scholar
[3] 3. Turán, P., Eine Extremalaufgabe aus der Graphen Théorie, Mat. Fiz. Lapok. 48 (1941) 436–452. Google Scholar
Cité par Sources :