| Title:
|
On locally quasiconnected graphs and their upper embeddability (English) |
| Author:
|
Nebeský, Ladislav |
| Language:
|
English |
| Journal:
|
Czechoslovak Mathematical Journal |
| ISSN:
|
0011-4642 (print) |
| ISSN:
|
1572-9141 (online) |
| Volume:
|
35 |
| Issue:
|
1 |
| Year:
|
1985 |
| Pages:
|
162-166 |
| Summary lang:
|
Russian |
| . |
| Category:
|
math |
| . |
| MSC:
|
05C10 |
| MSC:
|
05C40 |
| idZBL:
|
Zbl 0584.05031 |
| idMR:
|
MR779344 |
| DOI:
|
10.21136/CMJ.1985.102005 |
| . |
| Date available:
|
2008-06-09T15:04:09Z |
| Last updated:
|
2020-07-28 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/102005 |
| . |
| Reference:
|
[1] M. Behzad G. Chartrand, L. Lesniak-Foster: Graphs & Digraphs.Prindle, Weber & Schmidt, Boston 1979. MR 0525578 |
| Reference:
|
[2] G. Chartrand, R. E. Pippert: Locally connected graphs.Časopis pěst. mat. 99 (1974), 158-163. Zbl 0278.05113, MR 0398872 |
| Reference:
|
[3] N. P. Homenko N. A. Ostroverkhy, V. A. Kusmenko: The maximum genus of graphs.(in Ukrainian, English summary). $\varphi$-peretvorennya grafiv (N. P. Homenko, ed.), IM AN URSR, Kiev 1973, pp. 180-210. MR 0422065 |
| Reference:
|
[4] M. Jungerman: A characterization of upper embeddable graphs.Trans. Amer. Math. Soc. 241 (1978), 401-406. Zbl 0379.05025, MR 0492309 |
| Reference:
|
[5] L. Nebeský: Every connected, locally connected graph is upper embeddable.J. Graph Theory 5 (1981), 205-207. MR 0615009, 10.1002/jgt.3190050211 |
| Reference:
|
[6] L. Nebeský: A new characterization of the maximum genus of a graph.Czechoslovak Math. J. 31 (106) (1981), 604-613. MR 0631605 |
| Reference:
|
[7] R. D. Ringeisen: Survey of results on the maximum genus of a graph.J. Graph Theory 3 (1979), 1-13. Zbl 0398.05029, MR 0519169, 10.1002/jgt.3190030102 |
| Reference:
|
[8] G. Ringel: Map Color Theorem.Springer-Verlag, Berlin 1974. Zbl 0287.05102, MR 0349461 |
| Reference:
|
[9] A. T. White: Graphs, Groups, and Surfaces.North-Holland, Amsterdam 1973. Zbl 0268.05102 |
| Reference:
|
[10] N. H. Xuong: How to determine the maximum genus of a graph.J. Combinatorial Theory 26B (1979), 217-225. Zbl 0403.05035, MR 0532589, 10.1016/0095-8956(79)90058-3 |
| Reference:
|
[11] B. Zelinka: Locally tree-like graphs.Časopis pěst. mat. 108 (1983), 230-238. Zbl 0528.05040, MR 0716406 |
| . |
