Geodesic
Upper embeddable factorizations of graphs
Czechoslovak Mathematical Journal, Tome 34 (1984) no. 3, pp. 432-438

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

MR Zbl
DOI : 10.21136/CMJ.1984.101969
Classification : 05C10, 05C70 
Nebeský, Ladislav. Upper embeddable factorizations of graphs. Czechoslovak Mathematical Journal, Tome 34 (1984) no. 3, pp. 432-438. doi: 10.21136/CMJ.1984.101969
@article{10_21136_CMJ_1984_101969,
     author = {Nebesk\'y, Ladislav},
     title = {Upper embeddable factorizations of graphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {432--438},
     year = {1984},
     volume = {34},
     number = {3},
     doi = {10.21136/CMJ.1984.101969},
     mrnumber = {761426},
     zbl = {0583.05045},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1984.101969/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - Upper embeddable factorizations of graphs
JO  - Czechoslovak Mathematical Journal
PY  - 1984
SP  - 432
EP  - 438
VL  - 34
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1984.101969/
DO  - 10.21136/CMJ.1984.101969
LA  - en
ID  - 10_21136_CMJ_1984_101969
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T Upper embeddable factorizations of graphs
%J Czechoslovak Mathematical Journal
%D 1984
%P 432-438
%V 34
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1984.101969/
%R 10.21136/CMJ.1984.101969
%G en
%F 10_21136_CMJ_1984_101969

[1] M. Behzad G. Chartrand, and L. Lesniak-Foster: Graphs & Digraphs. Prindte, Weber & Schmidt, Boston 1979. | MR

[2] N. P. Homenko N. A. Ostroverkhy, and V. A. Kiismenko: The maximum genus of a graph. (in Ukrainian, English summary). $\fi$-peretvorennya grafiv (N. P. Homenko, ed.) IM AN URSR, Kiev 1973, pp. 180-210. | MR

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

[4] С. St. J. A. Nash-Williams: Edge-disjoint spanning trees of finite graphs. J. London Math, Soc. 36 (1961), 445-450. | MR | Zbl

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

[6] W. T. Tutte: On the problem of decomposing a graph into n connected factors. J. London Maih. Soc. 36 (1961), 221-230. | MR | Zbl

[7] A. T. White: Graphs, Groups, and Surfaces. North-Holland, Amsterdam 1973. | Zbl

[8] N. H. Xuong: How to determine the maximum genus of a graph. J. Combinatorial Theory 26 В (1979), 217-225. | DOI | MR | Zbl

Cité par Sources :