Geodesic
Edge and vertex operations on upper embeddable graphs
Mathematica slovaca, Tome 46 (1996) no. 1, pp. 9-19
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C10 
@article{MASLO_1996_46_1_a1,
     author = {Fu, Hung-Lin and Tsai, Ming-Chun},
     title = {Edge and vertex operations on upper embeddable graphs},
     journal = {Mathematica slovaca},
     pages = {9--19},
     year = {1996},
     volume = {46},
     number = {1},
     mrnumber = {1414405},
     zbl = {0858.05039},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1996_46_1_a1/}
}
TY  - JOUR
AU  - Fu, Hung-Lin
AU  - Tsai, Ming-Chun
TI  - Edge and vertex operations on upper embeddable graphs
JO  - Mathematica slovaca
PY  - 1996
SP  - 9
EP  - 19
VL  - 46
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/MASLO_1996_46_1_a1/
LA  - en
ID  - MASLO_1996_46_1_a1
ER  - 
%0 Journal Article
%A Fu, Hung-Lin
%A Tsai, Ming-Chun
%T Edge and vertex operations on upper embeddable graphs
%J Mathematica slovaca
%D 1996
%P 9-19
%V 46
%N 1
%U http://geodesic.mathdoc.fr/item/MASLO_1996_46_1_a1/
%G en
%F MASLO_1996_46_1_a1
Fu, Hung-Lin; Tsai, Ming-Chun. Edge and vertex operations on upper embeddable graphs. Mathematica slovaca, Tome 46 (1996) no. 1, pp. 9-19. http://geodesic.mathdoc.fr/item/MASLO_1996_46_1_a1/

[1] BEHZAD M.-CHARTRAD G.-LESNIAK-FOSTER L.: Graphs and Digraphs. Prindle, Weber and Schmidt, Boston, 1979.

[2] FU H. L.-TSAI M. C.: The maximum genus of diameter three graphs. Prepгint. | Zbl

[3] JUNGERMAN M.: A characterization of upper embeddable graphs. Trans. Amer. Math. Soc. 241 (1978), 401-406. | MR | Zbl

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

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

[6] NEBESKÝ L.: A note on upper embeddable graphs. Czechoslovak Math. J. 33(108) (1983), 37-40. | MR | Zbl

[7] NEBESKÝ L.: On 2-cell embeddings of graphs with minimum numbers of regions. Czechoslovak Math. J. 35(110) (1985), 625-631. | MR | Zbl

[8] NEDELA R.-ŠKOVIERA M.: The maximum genus of a graph and doubly Eulerian trails. Boll Un. Mat. Ital. B (7) 4 (1990), 541-551. | MR | Zbl

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

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