Geodesic
The decay number and the maximum genus of a graph
Mathematica slovaca, Tome 42 (1992) no. 4, pp. 391-406
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C10 
@article{MASLO_1992_42_4_a1,
     author = {\v{S}koviera, Martin},
     title = {The decay number and the maximum genus of a graph},
     journal = {Mathematica slovaca},
     pages = {391--406},
     year = {1992},
     volume = {42},
     number = {4},
     mrnumber = {1195033},
     zbl = {0760.05032},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1992_42_4_a1/}
}
TY  - JOUR
AU  - Škoviera, Martin
TI  - The decay number and the maximum genus of a graph
JO  - Mathematica slovaca
PY  - 1992
SP  - 391
EP  - 406
VL  - 42
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MASLO_1992_42_4_a1/
LA  - en
ID  - MASLO_1992_42_4_a1
ER  - 
%0 Journal Article
%A Škoviera, Martin
%T The decay number and the maximum genus of a graph
%J Mathematica slovaca
%D 1992
%P 391-406
%V 42
%N 4
%U http://geodesic.mathdoc.fr/item/MASLO_1992_42_4_a1/
%G en
%F MASLO_1992_42_4_a1
Škoviera, Martin. The decay number and the maximum genus of a graph. Mathematica slovaca, Tome 42 (1992) no. 4, pp. 391-406. http://geodesic.mathdoc.fr/item/MASLO_1992_42_4_a1/

[1] BOUCHET A.: Genre maximum d'un Δ-graphe. In: Problèmes combinatoires et thèorie des graphes. Colloques Internat. C.N.R.S. 260, C.N.R.S., Paris, 1978, pp. 57-60. | MR

[2] CHARTRAND G., LESNIAK L.: Graphs & Digraphs, 2nd Ed. Wadsworth & Brooks-Cole, 1986. | MR | Zbl

[3] JAEGER F., XUONG N. H., PAYAN C.: Genre maximal et connectivité d'un graphe. C.R. Acad. Sci. Paris Sér. A 285 (1977), 337-339. | Zbl

[4] KHOMENKO N. P., GLUKHOV A. D.: On upper embeddable graphs. (Russian) In: Graph Theory, Izd. Inst. Mat. Akad. Nauk Ukrain. SSR, Kiev, 1977, pp. 85-89. | MR | Zbl

[5] KUNDU S.: Bounds on the number of disjoint spanning trees. J. Combin. Theory Ser. B 17 (1974), 199-203. | MR

[6] NEBESKÝ L.: A new characterization of the maximum genus of a graph. Czechoslovak Math. J. 31(106) (1981), 604-613. | MR | Zbl

[7] NEBESKÝ L.: On locally quasiconnected graphs and their upper embeddability. Czechoslovak Math. J. 35(110) (1985), 162-166. | MR | Zbl

[8] ŠKOVIERA M.: The maximum genus of graphs of diameter two. Discrete Math. 87 (1991), 175-180. | MR | Zbl

[9] XUONG N. H.: How to determine the maximum genus of a graph. J. Combin. Theory Ser. B 26 (1979), 217-225. | MR | Zbl