Edges in graphs with large girth-Reference-Cited by-同舟云学术

Edges in graphs with large girth

Published:1991-12 Issue:4 Volume:7 Page:315-321
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Dutton R. D.,Brigham R. C.

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01787638.pdf

Reference8 articles.

1. Bollobás, B.: Ket fuggelten kort nem tartalmazo grafokrol, Mat. Lapok14, 311–321 (1963)

2. Bollobás, B.: Extremal Graph Theory, Academic Press, New York (1978)

3. Dutton, R.D. and Brigham, R.C.: Edges in graphs with large girth, Department of Mathematics Technical Report M-11, University of Central Florida, Orlando, FL 32816, 1988

4. Elsner, T.E.: Problem 6159, American Math. Monthly (1977)

5. Reiman, I.: über ein Problem von K. Zarankiewicz, Acta., Math. Acad. Sci. Hungar.9, 269–273 (1958)

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

1. Density of Balanced 3-Partite Graphs without 3-Cycles or 4-Cycles;The Electronic Journal of Combinatorics;2022-12-16

2. On the price of stability of some simple graph-based hedonic games;Theoretical Computer Science;2021-02

3. Distance Hedonic Games;SOFSEM 2021: Theory and Practice of Computer Science;2021

4. On Non-Cooperativeness in Social Distance Games;Journal of Artificial Intelligence Research;2019-11-11

5. Some further results on the eccentric distance sum;Journal of Mathematical Analysis and Applications;2019-02