Geodesic
Face size and the maximum genus of a graph. II: Nonsimple graphs
Mathematica slovaca, Tome 51 (2001) no. 2, pp. 129-140
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C10, 05C40 
@article{MASLO_2001_51_2_a0,
     author = {Huang, Yuanqiu and Liu, Yanpei},
     title = {Face size and the maximum genus of a graph. {II:} {Nonsimple} graphs},
     journal = {Mathematica slovaca},
     pages = {129--140},
     year = {2001},
     volume = {51},
     number = {2},
     mrnumber = {1841442},
     zbl = {0985.05018},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_2001_51_2_a0/}
}
TY  - JOUR
AU  - Huang, Yuanqiu
AU  - Liu, Yanpei
TI  - Face size and the maximum genus of a graph. II: Nonsimple graphs
JO  - Mathematica slovaca
PY  - 2001
SP  - 129
EP  - 140
VL  - 51
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MASLO_2001_51_2_a0/
LA  - en
ID  - MASLO_2001_51_2_a0
ER  - 
%0 Journal Article
%A Huang, Yuanqiu
%A Liu, Yanpei
%T Face size and the maximum genus of a graph. II: Nonsimple graphs
%J Mathematica slovaca
%D 2001
%P 129-140
%V 51
%N 2
%U http://geodesic.mathdoc.fr/item/MASLO_2001_51_2_a0/
%G en
%F MASLO_2001_51_2_a0
Huang, Yuanqiu; Liu, Yanpei. Face size and the maximum genus of a graph. II: Nonsimple graphs. Mathematica slovaca, Tome 51 (2001) no. 2, pp. 129-140. http://geodesic.mathdoc.fr/item/MASLO_2001_51_2_a0/

[1] FU H.-TSAI M.: The maximum genus of diameter three graphs. Australas. J. Combin. 14 (1996), 1187-1197. | MR | Zbl

[2] GROSS J.-TUCKER T.: Topological Graph Theory. John Wiley, New York, 1987. | MR | Zbl

[3] HUANG Y.-LIU Y.: Face size and the maximum genus of a graph. Part 1: Simple graphs. 3. Combin. Theory Ser. B 80 (2000), 356-370. | MR

[4] NEDELA R.-SKOVIERA M.: On graphs embeddable with short faces. In: Topics in Combinatorics and Graph Theory (R. Bodendiek, R. Henn, eds.), Physica Verlag, Heidelberg, 1990, pp. 519-529. | MR | Zbl

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

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

[7] RINGEISEN R. D.: Survey of results on the maximum genus of a graph. J. Graph Theory 3 (1978), 1-13. | MR

[8] THOMASSEN C.: Embeddings of graphs with no short noncontractible cycles. J. Combin. Theory Ser. B 42 (1990), 155-177. | MR | Zbl