On 2-cell embeddings of graphs with minimum numbers of regions

Ladislav Nebeský

Czechoslovak Mathematical Journal (1985)

  • Volume: 35, Issue: 4, page 625-631
  • ISSN: 0011-4642

How to cite

top

Nebeský, Ladislav. "On 2-cell embeddings of graphs with minimum numbers of regions." Czechoslovak Mathematical Journal 35.4 (1985): 625-631. <http://eudml.org/doc/13546>.

@article{Nebeský1985,
author = {Nebeský, Ladislav},
journal = {Czechoslovak Mathematical Journal},
keywords = {upper embeddable graph; maximum genus},
language = {eng},
number = {4},
pages = {625-631},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On 2-cell embeddings of graphs with minimum numbers of regions},
url = {http://eudml.org/doc/13546},
volume = {35},
year = {1985},
}

TY - JOUR
AU - Nebeský, Ladislav
TI - On 2-cell embeddings of graphs with minimum numbers of regions
JO - Czechoslovak Mathematical Journal
PY - 1985
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 35
IS - 4
SP - 625
EP - 631
LA - eng
KW - upper embeddable graph; maximum genus
UR - http://eudml.org/doc/13546
ER -

References

top
  1. M. Behzad G. Chartrand, and L. Lesniak-Foster, Graphs & Digraphs, Prindle, Weber & Schmidt, Boston 1979. (1979) MR0525578
  2. F. Harary, Graph Theory, Addison-Wesley, Reading (Mass.) 1969. (1969) Zbl0196.27202MR0256911
  3. N. P. Homenko N. A. Ostroverkhy, and V. A. Kusmenko, The maximum genus of a graph, (in Ukrainian, English summary), -peretvorennya grafiv (N. P. Homenko, ed.) IM AN URSR, Kiev 1973, pp. 180-210. (1973) MR0351870
  4. M. Jungerman, A characterization of upper embeddable graphs, Trans. Amer. Math. Soc. 241 (1978), 401-406. (1978) Zbl0379.05025MR0492309
  5. L. Nebeský, A new characterization of the maximum genus of a graph, Czechoslovak Math. J. 31 (106) (1981), 604-613. (1981) MR0631605
  6. L. Nebeský, A note on upper embeddable graphs, Czechoslovak Math. J. 33 (108) (1983), 37-40. (1983) MR0687415
  7. L. Nebeský, On a diffusion of a set of vertices in a connected graph, In: Graphs and Other Combinatorial Topics (Proc. Third Czechoslovak Symp. Graph Theory held in Prague, 1982) (M. Fiedler, ed.), Teubner-Texte zur Mathematik, Band 59, Teubner, Leipzig 1983, pp. 200-203. (1982) MR0737038
  8. E. A. Nordhaus R. D. Ringeisen В. M. Stewart, and A. T. White, 10.1016/0095-8956(72)90040-8, J. Combinatorial Theory 12 В (1972), 260-267. (1972) MR0299523DOI10.1016/0095-8956(72)90040-8
  9. G. Ringel, 10.1002/jgt.3190010210, J. Graph Theory 1 (1977), 141 - 155. (1977) Zbl0386.05030MR0444509DOI10.1002/jgt.3190010210
  10. N. H. Xuong, 10.1016/0095-8956(79)90058-3, J. Combinatorial Theory 26 В (1979), 217-225. (1979) Zbl0403.05035MR0532589DOI10.1016/0095-8956(79)90058-3

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.