Covering odd cycles-Reference-Cited by-同舟云学术

Covering odd cycles

Published:1997-09 Issue:3 Volume:17 Page:393-400
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Koml�s J�nos

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

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

Reference3 articles.

1. B. Bollobás, P. Erd?s, M. Simonovits, andE. Szemerédi: Extramal graphs without large forbidden subgraphs, Advances in Graph Theory, B. Bollobás ed.,Annals of Discrete Mathematics,3 (1978), 29?41, also appeared as a problem inB. Bollobás:Extremal Graph Theory, Academic Press 1978, p. 367 Problem 47.

2. R. Häggkvist: Odd cycles of specified length in non-bipartite graphs,Graph Theory, B. Bollobás ed.,Annals of Discrete Mathematics,13 (1982), 89?100.

3. A. Lubotzky, R. Phillips, P. Sarnak: Ramanujan graphs,Combinatorica,8 (1988), 261?277.

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

1. A generalized Turán problem and its applications;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20

2. A Generalized Turán Problem and its Applications;International Mathematics Research Notices;2018-06-04

3. Sublinear Time Algorithms;SIAM Journal on Discrete Mathematics;2011-01

4. Approximating Maximum Subgraphs without Short Cycles;SIAM Journal on Discrete Mathematics;2010-01

5. Approximation algorithms and hardness results for cycle packing problems;ACM Transactions on Algorithms;2007-11