Geodesic
Contraction distance between isomorphism classes of graphs
Časopis pro pěstování matematiky, Tome 115 (1990) no. 2, pp. 211-216 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CPM.1990.108363
Classification : 05C12 
@article{10_21136_CPM_1990_108363,
     author = {Zelinka, Bohdan},
     title = {Contraction distance between isomorphism classes of graphs},
     journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
     pages = {211--216},
     year = {1990},
     volume = {115},
     number = {2},
     doi = {10.21136/CPM.1990.108363},
     mrnumber = {1054008},
     zbl = {0731.05016},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1990.108363/}
}
TY  - JOUR
AU  - Zelinka, Bohdan
TI  - Contraction distance between isomorphism classes of graphs
JO  - Časopis pro pěstování matematiky
PY  - 1990
SP  - 211
EP  - 216
VL  - 115
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1990.108363/
DO  - 10.21136/CPM.1990.108363
LA  - en
ID  - 10_21136_CPM_1990_108363
ER  - 
%0 Journal Article
%A Zelinka, Bohdan
%T Contraction distance between isomorphism classes of graphs
%J Časopis pro pěstování matematiky
%D 1990
%P 211-216
%V 115
%N 2
%U http://geodesic.mathdoc.fr/articles/10.21136/CPM.1990.108363/
%R 10.21136/CPM.1990.108363
%G en
%F 10_21136_CPM_1990_108363
Zelinka, Bohdan. Contraction distance between isomorphism classes of graphs. Časopis pro pěstování matematiky, Tome 115 (1990) no. 2, pp. 211-216. doi: 10.21136/CPM.1990.108363

[1] V. Baláž J. Koča V. Kvasnička M. Sekanina: A metric foг gгaphs. Časopis pěst. mat. 111 (1986), 431-433. | MR

[2] G. Chartrand F. Saba H.-B. Zou: Edg eгotations and distance between graphs. Časopis pest. mat. 110 (1985), 87-91. | MR

[3] F. Kaden: Gгaph metrics and distance graphs. In: Graphs and Other Combinatorial Topics. Proc. Symp. Prague 1982 (ed. M. Ғiedler). Teubner Leipzig 1983. | MR

[4] Z. Miller: Contraction of graphs: a theorem of Ore and an extremal problem. Discr. Math. 21(1978), 261-272. | MR

[5] F. Sobik: On some measures of distance between graphs. In: Graphs and Other Combinatorial Topics, Proc. Symp. Prague (ed. M. Fiedler). Teubner Leipzig 1983. | MR | Zbl

[6] B. Zelinka: On a certain distance between isomorphism classes of graphs. Časopis pest. mat. 100 (1975), 371-373. | MR | Zbl

[7] B. Zelinka: A distance between isomorphism classes of trees. Czechoslovak Math. Ј. 33 (1983), 126-130. | MR | Zbl

[8] B. Zelinka: Comparison of various distances between isomorphism classes of graphs. Časopis pěst. mat. 110 (1985), 289-293. | MR | Zbl

[9] A. A. Zykov: On the edge numbeг of graphs with no greater Hadwiger number than 4. Prikl. mat. i progr. 7 (1972), 52-55. | MR

Cité par Sources :