Up-Embeddability of a Graph by Order and Girth-Reference-Cited by-同舟云学术

Up-Embeddability of a Graph by Order and Girth

Published:2007-10 Issue:5 Volume:23 Page:521-527
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Chen Yichao,Liu Yanpei

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00373-007-0746-8.pdf

Reference20 articles.

1. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, Macmillan, London 1979

2. Huang, Y.Q., Liu, Y.P.: An improvement of a theorem on the maximum genus for graphs, Math. Appl. 11, 109–112 (1998)

3. Huang, Y.Q., Liu. Y.P.: The degree-sum of nonadjacent vertices and up-embeddability of graphs, Chinese J. Contemp. Math. 19, 651–656 (1998) (in Chinese)

4. Jaeger, F., Payan, C., Xuong, N.H.: A class of upper embeddable graphs, J. Graph Theory 3, 387–391 (1979)

5. Jungerman, M.: A characterization of upper embeddable graphs, Trans. Am. Math. Soc. 241, 401–406 (1987)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Up-embeddability of graphs with new degree-sum;Acta Mathematicae Applicatae Sinica, English Series;2017-02

2. Upper embeddability, edge independence number and girth;Science in China Series A: Mathematics;2009-07-09

3. Upper Embeddability, Girth and the Degree-Sum of Nonadjacent Vertices;Graphs and Combinatorics;2009-05

4. On the robustness of chaos in dynamical systems: Theories and applications;Frontiers of Physics in China;2008-05-21